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_copy8_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:02:31,810 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:02:31,812 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:02:31,825 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:02:31,825 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:02:31,826 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:02:31,828 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:02:31,829 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:02:31,831 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:02:31,832 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:02:31,833 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:02:31,833 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:02:31,834 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:02:31,835 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:02:31,836 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:02:31,837 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:02:31,838 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:02:31,840 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:02:31,842 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:02:31,843 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:02:31,844 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:02:31,846 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:02:31,848 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:02:31,849 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:02:31,849 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:02:31,850 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:02:31,851 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:02:31,852 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:02:31,855 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:02:31,857 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:02:31,857 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:02:31,857 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:02:31,859 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:02:31,859 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:02:31,860 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:02:31,862 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:02:31,862 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:02:31,890 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:02:31,890 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:02:31,891 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:02:31,892 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:02:31,893 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:02:31,893 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:02:31,893 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:02:31,894 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:02:31,894 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:02:31,894 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:02:31,894 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:02:31,895 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:02:31,896 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:02:31,896 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:02:31,896 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:02:31,896 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:02:31,896 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:02:31,897 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:02:31,897 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:02:31,897 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:02:31,897 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:02:31,897 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:02:31,898 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:02:31,899 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:02:31,899 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:02:31,899 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:02:31,900 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:02:31,900 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:02:31,900 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:02:31,900 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:02:31,900 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:02:31,901 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:02:31,901 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:02:31,967 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:02:31,987 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:02:31,992 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:02:31,994 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:02:31,994 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:02:31,995 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy8_true-unreach-call_ground.i [2018-11-23 10:02:32,066 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b35c676/a7365636fecd4f558a357ca5a520c8ac/FLAG18e9bdb8a [2018-11-23 10:02:32,543 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:02:32,544 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy8_true-unreach-call_ground.i [2018-11-23 10:02:32,551 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b35c676/a7365636fecd4f558a357ca5a520c8ac/FLAG18e9bdb8a [2018-11-23 10:02:32,914 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b35c676/a7365636fecd4f558a357ca5a520c8ac [2018-11-23 10:02:32,925 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:02:32,929 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:02:32,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:02:32,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:02:32,935 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:02:32,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:02:32" (1/1) ... [2018-11-23 10:02:32,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d95694f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:32, skipping insertion in model container [2018-11-23 10:02:32,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:02:32" (1/1) ... [2018-11-23 10:02:32,951 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:02:32,976 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:02:33,275 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:02:33,283 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:02:33,346 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:02:33,376 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:02:33,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:33 WrapperNode [2018-11-23 10:02:33,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:02:33,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:02:33,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:02:33,377 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:02:33,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:33" (1/1) ... [2018-11-23 10:02:33,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:33" (1/1) ... [2018-11-23 10:02:33,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:02:33,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:02:33,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:02:33,407 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:02:33,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:33" (1/1) ... [2018-11-23 10:02:33,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:33" (1/1) ... [2018-11-23 10:02:33,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:33" (1/1) ... [2018-11-23 10:02:33,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:33" (1/1) ... [2018-11-23 10:02:33,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:33" (1/1) ... [2018-11-23 10:02:33,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:33" (1/1) ... [2018-11-23 10:02:33,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:33" (1/1) ... [2018-11-23 10:02:33,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:02:33,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:02:33,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:02:33,474 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:02:33,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:02:33,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:02:33,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:02:33,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:02:33,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:02:33,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:02:33,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:02:33,602 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:02:33,602 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:02:33,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:02:33,603 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:02:33,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:02:33,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:02:34,699 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:02:34,699 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-23 10:02:34,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:34 BoogieIcfgContainer [2018-11-23 10:02:34,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:02:34,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:02:34,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:02:34,704 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:02:34,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:02:32" (1/3) ... [2018-11-23 10:02:34,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eaccbd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:02:34, skipping insertion in model container [2018-11-23 10:02:34,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:33" (2/3) ... [2018-11-23 10:02:34,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eaccbd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:02:34, skipping insertion in model container [2018-11-23 10:02:34,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:34" (3/3) ... [2018-11-23 10:02:34,708 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy8_true-unreach-call_ground.i [2018-11-23 10:02:34,718 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:02:34,726 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:02:34,745 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:02:34,778 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:02:34,778 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:02:34,778 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:02:34,779 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:02:34,779 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:02:34,779 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:02:34,780 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:02:34,780 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:02:34,780 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:02:34,798 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-11-23 10:02:34,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 10:02:34,806 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:34,807 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, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:34,810 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:34,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:34,816 INFO L82 PathProgramCache]: Analyzing trace with hash 661673386, now seen corresponding path program 1 times [2018-11-23 10:02:34,820 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:34,821 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:34,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:34,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:35,151 INFO L256 TraceCheckUtils]: 0: Hoare triple {51#true} call ULTIMATE.init(); {51#true} is VALID [2018-11-23 10:02:35,154 INFO L273 TraceCheckUtils]: 1: Hoare triple {51#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {51#true} is VALID [2018-11-23 10:02:35,155 INFO L273 TraceCheckUtils]: 2: Hoare triple {51#true} assume true; {51#true} is VALID [2018-11-23 10:02:35,156 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {51#true} {51#true} #161#return; {51#true} is VALID [2018-11-23 10:02:35,156 INFO L256 TraceCheckUtils]: 4: Hoare triple {51#true} call #t~ret21 := main(); {51#true} is VALID [2018-11-23 10:02:35,156 INFO L273 TraceCheckUtils]: 5: Hoare triple {51#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {51#true} is VALID [2018-11-23 10:02:35,161 INFO L273 TraceCheckUtils]: 6: Hoare triple {51#true} assume !true; {52#false} is VALID [2018-11-23 10:02:35,161 INFO L273 TraceCheckUtils]: 7: Hoare triple {52#false} havoc ~i~0;~i~0 := 0bv32; {52#false} is VALID [2018-11-23 10:02:35,161 INFO L273 TraceCheckUtils]: 8: Hoare triple {52#false} assume !~bvslt32(~i~0, 100000bv32); {52#false} is VALID [2018-11-23 10:02:35,162 INFO L273 TraceCheckUtils]: 9: Hoare triple {52#false} ~i~0 := 0bv32; {52#false} is VALID [2018-11-23 10:02:35,162 INFO L273 TraceCheckUtils]: 10: Hoare triple {52#false} assume !~bvslt32(~i~0, 100000bv32); {52#false} is VALID [2018-11-23 10:02:35,162 INFO L273 TraceCheckUtils]: 11: Hoare triple {52#false} ~i~0 := 0bv32; {52#false} is VALID [2018-11-23 10:02:35,162 INFO L273 TraceCheckUtils]: 12: Hoare triple {52#false} assume !~bvslt32(~i~0, 100000bv32); {52#false} is VALID [2018-11-23 10:02:35,163 INFO L273 TraceCheckUtils]: 13: Hoare triple {52#false} ~i~0 := 0bv32; {52#false} is VALID [2018-11-23 10:02:35,163 INFO L273 TraceCheckUtils]: 14: Hoare triple {52#false} assume !~bvslt32(~i~0, 100000bv32); {52#false} is VALID [2018-11-23 10:02:35,163 INFO L273 TraceCheckUtils]: 15: Hoare triple {52#false} ~i~0 := 0bv32; {52#false} is VALID [2018-11-23 10:02:35,164 INFO L273 TraceCheckUtils]: 16: Hoare triple {52#false} assume !~bvslt32(~i~0, 100000bv32); {52#false} is VALID [2018-11-23 10:02:35,164 INFO L273 TraceCheckUtils]: 17: Hoare triple {52#false} ~i~0 := 0bv32; {52#false} is VALID [2018-11-23 10:02:35,164 INFO L273 TraceCheckUtils]: 18: Hoare triple {52#false} assume !true; {52#false} is VALID [2018-11-23 10:02:35,165 INFO L273 TraceCheckUtils]: 19: Hoare triple {52#false} ~i~0 := 0bv32; {52#false} is VALID [2018-11-23 10:02:35,165 INFO L273 TraceCheckUtils]: 20: Hoare triple {52#false} assume !true; {52#false} is VALID [2018-11-23 10:02:35,165 INFO L273 TraceCheckUtils]: 21: Hoare triple {52#false} ~i~0 := 0bv32; {52#false} is VALID [2018-11-23 10:02:35,166 INFO L273 TraceCheckUtils]: 22: Hoare triple {52#false} assume !true; {52#false} is VALID [2018-11-23 10:02:35,166 INFO L273 TraceCheckUtils]: 23: Hoare triple {52#false} havoc ~x~0;~x~0 := 0bv32; {52#false} is VALID [2018-11-23 10:02:35,166 INFO L273 TraceCheckUtils]: 24: Hoare triple {52#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem19 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem20 := read~intINTTYPE4(~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {52#false} is VALID [2018-11-23 10:02:35,167 INFO L256 TraceCheckUtils]: 25: Hoare triple {52#false} call __VERIFIER_assert((if #t~mem19 == #t~mem20 then 1bv32 else 0bv32)); {52#false} is VALID [2018-11-23 10:02:35,167 INFO L273 TraceCheckUtils]: 26: Hoare triple {52#false} ~cond := #in~cond; {52#false} is VALID [2018-11-23 10:02:35,167 INFO L273 TraceCheckUtils]: 27: Hoare triple {52#false} assume 0bv32 == ~cond; {52#false} is VALID [2018-11-23 10:02:35,168 INFO L273 TraceCheckUtils]: 28: Hoare triple {52#false} assume !false; {52#false} is VALID [2018-11-23 10:02:35,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:35,174 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:35,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:35,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:02:35,192 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-23 10:02:35,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:35,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:02:35,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:35,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:02:35,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:02:35,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:02:35,428 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 2 states. [2018-11-23 10:02:35,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:35,609 INFO L93 Difference]: Finished difference Result 88 states and 127 transitions. [2018-11-23 10:02:35,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:02:35,609 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-23 10:02:35,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:35,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:02:35,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 127 transitions. [2018-11-23 10:02:35,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:02:35,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 127 transitions. [2018-11-23 10:02:35,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 127 transitions. [2018-11-23 10:02:36,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:36,564 INFO L225 Difference]: With dead ends: 88 [2018-11-23 10:02:36,564 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 10:02:36,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:02:36,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 10:02:36,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 10:02:36,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:36,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-23 10:02:36,629 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 10:02:36,629 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 10:02:36,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:36,635 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-11-23 10:02:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-23 10:02:36,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:36,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:36,637 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 10:02:36,637 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 10:02:36,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:36,642 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-11-23 10:02:36,643 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-23 10:02:36,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:36,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:36,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:36,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 10:02:36,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-11-23 10:02:36,650 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 29 [2018-11-23 10:02:36,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:36,651 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-23 10:02:36,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:02:36,651 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-23 10:02:36,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 10:02:36,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:36,653 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, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:36,653 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:36,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:36,654 INFO L82 PathProgramCache]: Analyzing trace with hash 904564754, now seen corresponding path program 1 times [2018-11-23 10:02:36,654 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:36,654 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:36,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:36,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:36,847 INFO L256 TraceCheckUtils]: 0: Hoare triple {399#true} call ULTIMATE.init(); {399#true} is VALID [2018-11-23 10:02:36,847 INFO L273 TraceCheckUtils]: 1: Hoare triple {399#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {399#true} is VALID [2018-11-23 10:02:36,847 INFO L273 TraceCheckUtils]: 2: Hoare triple {399#true} assume true; {399#true} is VALID [2018-11-23 10:02:36,848 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {399#true} {399#true} #161#return; {399#true} is VALID [2018-11-23 10:02:36,848 INFO L256 TraceCheckUtils]: 4: Hoare triple {399#true} call #t~ret21 := main(); {399#true} is VALID [2018-11-23 10:02:36,866 INFO L273 TraceCheckUtils]: 5: Hoare triple {399#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {419#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:36,867 INFO L273 TraceCheckUtils]: 6: Hoare triple {419#(= main_~a~0 (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {400#false} is VALID [2018-11-23 10:02:36,868 INFO L273 TraceCheckUtils]: 7: Hoare triple {400#false} havoc ~i~0;~i~0 := 0bv32; {400#false} is VALID [2018-11-23 10:02:36,868 INFO L273 TraceCheckUtils]: 8: Hoare triple {400#false} assume !~bvslt32(~i~0, 100000bv32); {400#false} is VALID [2018-11-23 10:02:36,868 INFO L273 TraceCheckUtils]: 9: Hoare triple {400#false} ~i~0 := 0bv32; {400#false} is VALID [2018-11-23 10:02:36,869 INFO L273 TraceCheckUtils]: 10: Hoare triple {400#false} assume !~bvslt32(~i~0, 100000bv32); {400#false} is VALID [2018-11-23 10:02:36,869 INFO L273 TraceCheckUtils]: 11: Hoare triple {400#false} ~i~0 := 0bv32; {400#false} is VALID [2018-11-23 10:02:36,869 INFO L273 TraceCheckUtils]: 12: Hoare triple {400#false} assume !~bvslt32(~i~0, 100000bv32); {400#false} is VALID [2018-11-23 10:02:36,870 INFO L273 TraceCheckUtils]: 13: Hoare triple {400#false} ~i~0 := 0bv32; {400#false} is VALID [2018-11-23 10:02:36,870 INFO L273 TraceCheckUtils]: 14: Hoare triple {400#false} assume !~bvslt32(~i~0, 100000bv32); {400#false} is VALID [2018-11-23 10:02:36,871 INFO L273 TraceCheckUtils]: 15: Hoare triple {400#false} ~i~0 := 0bv32; {400#false} is VALID [2018-11-23 10:02:36,871 INFO L273 TraceCheckUtils]: 16: Hoare triple {400#false} assume !~bvslt32(~i~0, 100000bv32); {400#false} is VALID [2018-11-23 10:02:36,871 INFO L273 TraceCheckUtils]: 17: Hoare triple {400#false} ~i~0 := 0bv32; {400#false} is VALID [2018-11-23 10:02:36,871 INFO L273 TraceCheckUtils]: 18: Hoare triple {400#false} assume !~bvslt32(~i~0, 100000bv32); {400#false} is VALID [2018-11-23 10:02:36,872 INFO L273 TraceCheckUtils]: 19: Hoare triple {400#false} ~i~0 := 0bv32; {400#false} is VALID [2018-11-23 10:02:36,872 INFO L273 TraceCheckUtils]: 20: Hoare triple {400#false} assume !~bvslt32(~i~0, 100000bv32); {400#false} is VALID [2018-11-23 10:02:36,873 INFO L273 TraceCheckUtils]: 21: Hoare triple {400#false} ~i~0 := 0bv32; {400#false} is VALID [2018-11-23 10:02:36,873 INFO L273 TraceCheckUtils]: 22: Hoare triple {400#false} assume !~bvslt32(~i~0, 100000bv32); {400#false} is VALID [2018-11-23 10:02:36,873 INFO L273 TraceCheckUtils]: 23: Hoare triple {400#false} havoc ~x~0;~x~0 := 0bv32; {400#false} is VALID [2018-11-23 10:02:36,874 INFO L273 TraceCheckUtils]: 24: Hoare triple {400#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem19 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem20 := read~intINTTYPE4(~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {400#false} is VALID [2018-11-23 10:02:36,874 INFO L256 TraceCheckUtils]: 25: Hoare triple {400#false} call __VERIFIER_assert((if #t~mem19 == #t~mem20 then 1bv32 else 0bv32)); {400#false} is VALID [2018-11-23 10:02:36,874 INFO L273 TraceCheckUtils]: 26: Hoare triple {400#false} ~cond := #in~cond; {400#false} is VALID [2018-11-23 10:02:36,875 INFO L273 TraceCheckUtils]: 27: Hoare triple {400#false} assume 0bv32 == ~cond; {400#false} is VALID [2018-11-23 10:02:36,875 INFO L273 TraceCheckUtils]: 28: Hoare triple {400#false} assume !false; {400#false} is VALID [2018-11-23 10:02:36,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:36,877 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:36,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:36,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:02:36,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:02:36,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:36,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:02:37,047 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:37,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:02:37,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:02:37,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:37,049 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 3 states. [2018-11-23 10:02:37,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:37,327 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2018-11-23 10:02:37,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:02:37,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:02:37,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:37,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:37,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-23 10:02:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:37,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-23 10:02:37,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2018-11-23 10:02:37,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:37,682 INFO L225 Difference]: With dead ends: 80 [2018-11-23 10:02:37,682 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 10:02:37,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:37,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 10:02:37,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-23 10:02:37,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:37,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 44 states. [2018-11-23 10:02:37,704 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 44 states. [2018-11-23 10:02:37,704 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 44 states. [2018-11-23 10:02:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:37,708 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2018-11-23 10:02:37,708 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2018-11-23 10:02:37,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:37,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:37,710 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 45 states. [2018-11-23 10:02:37,710 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 45 states. [2018-11-23 10:02:37,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:37,713 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2018-11-23 10:02:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2018-11-23 10:02:37,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:37,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:37,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:37,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 10:02:37,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-23 10:02:37,718 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 29 [2018-11-23 10:02:37,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:37,718 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-23 10:02:37,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:02:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 10:02:37,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 10:02:37,720 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:37,720 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:37,720 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:37,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:37,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1833019696, now seen corresponding path program 1 times [2018-11-23 10:02:37,721 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:37,721 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:37,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:37,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:37,881 INFO L256 TraceCheckUtils]: 0: Hoare triple {747#true} call ULTIMATE.init(); {747#true} is VALID [2018-11-23 10:02:37,882 INFO L273 TraceCheckUtils]: 1: Hoare triple {747#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {747#true} is VALID [2018-11-23 10:02:37,882 INFO L273 TraceCheckUtils]: 2: Hoare triple {747#true} assume true; {747#true} is VALID [2018-11-23 10:02:37,882 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {747#true} {747#true} #161#return; {747#true} is VALID [2018-11-23 10:02:37,882 INFO L256 TraceCheckUtils]: 4: Hoare triple {747#true} call #t~ret21 := main(); {747#true} is VALID [2018-11-23 10:02:37,885 INFO L273 TraceCheckUtils]: 5: Hoare triple {747#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {767#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:37,886 INFO L273 TraceCheckUtils]: 6: Hoare triple {767#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {767#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:37,887 INFO L273 TraceCheckUtils]: 7: Hoare triple {767#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {774#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:37,888 INFO L273 TraceCheckUtils]: 8: Hoare triple {774#(= (_ bv1 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {748#false} is VALID [2018-11-23 10:02:37,888 INFO L273 TraceCheckUtils]: 9: Hoare triple {748#false} havoc ~i~0;~i~0 := 0bv32; {748#false} is VALID [2018-11-23 10:02:37,888 INFO L273 TraceCheckUtils]: 10: Hoare triple {748#false} assume !~bvslt32(~i~0, 100000bv32); {748#false} is VALID [2018-11-23 10:02:37,889 INFO L273 TraceCheckUtils]: 11: Hoare triple {748#false} ~i~0 := 0bv32; {748#false} is VALID [2018-11-23 10:02:37,889 INFO L273 TraceCheckUtils]: 12: Hoare triple {748#false} assume !~bvslt32(~i~0, 100000bv32); {748#false} is VALID [2018-11-23 10:02:37,890 INFO L273 TraceCheckUtils]: 13: Hoare triple {748#false} ~i~0 := 0bv32; {748#false} is VALID [2018-11-23 10:02:37,890 INFO L273 TraceCheckUtils]: 14: Hoare triple {748#false} assume !~bvslt32(~i~0, 100000bv32); {748#false} is VALID [2018-11-23 10:02:37,890 INFO L273 TraceCheckUtils]: 15: Hoare triple {748#false} ~i~0 := 0bv32; {748#false} is VALID [2018-11-23 10:02:37,891 INFO L273 TraceCheckUtils]: 16: Hoare triple {748#false} assume !~bvslt32(~i~0, 100000bv32); {748#false} is VALID [2018-11-23 10:02:37,891 INFO L273 TraceCheckUtils]: 17: Hoare triple {748#false} ~i~0 := 0bv32; {748#false} is VALID [2018-11-23 10:02:37,892 INFO L273 TraceCheckUtils]: 18: Hoare triple {748#false} assume !~bvslt32(~i~0, 100000bv32); {748#false} is VALID [2018-11-23 10:02:37,892 INFO L273 TraceCheckUtils]: 19: Hoare triple {748#false} ~i~0 := 0bv32; {748#false} is VALID [2018-11-23 10:02:37,892 INFO L273 TraceCheckUtils]: 20: Hoare triple {748#false} assume !~bvslt32(~i~0, 100000bv32); {748#false} is VALID [2018-11-23 10:02:37,892 INFO L273 TraceCheckUtils]: 21: Hoare triple {748#false} ~i~0 := 0bv32; {748#false} is VALID [2018-11-23 10:02:37,893 INFO L273 TraceCheckUtils]: 22: Hoare triple {748#false} assume !~bvslt32(~i~0, 100000bv32); {748#false} is VALID [2018-11-23 10:02:37,893 INFO L273 TraceCheckUtils]: 23: Hoare triple {748#false} ~i~0 := 0bv32; {748#false} is VALID [2018-11-23 10:02:37,893 INFO L273 TraceCheckUtils]: 24: Hoare triple {748#false} assume !~bvslt32(~i~0, 100000bv32); {748#false} is VALID [2018-11-23 10:02:37,894 INFO L273 TraceCheckUtils]: 25: Hoare triple {748#false} havoc ~x~0;~x~0 := 0bv32; {748#false} is VALID [2018-11-23 10:02:37,894 INFO L273 TraceCheckUtils]: 26: Hoare triple {748#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem19 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem20 := read~intINTTYPE4(~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {748#false} is VALID [2018-11-23 10:02:37,894 INFO L256 TraceCheckUtils]: 27: Hoare triple {748#false} call __VERIFIER_assert((if #t~mem19 == #t~mem20 then 1bv32 else 0bv32)); {748#false} is VALID [2018-11-23 10:02:37,895 INFO L273 TraceCheckUtils]: 28: Hoare triple {748#false} ~cond := #in~cond; {748#false} is VALID [2018-11-23 10:02:37,895 INFO L273 TraceCheckUtils]: 29: Hoare triple {748#false} assume 0bv32 == ~cond; {748#false} is VALID [2018-11-23 10:02:37,895 INFO L273 TraceCheckUtils]: 30: Hoare triple {748#false} assume !false; {748#false} is VALID [2018-11-23 10:02:37,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:37,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:38,009 INFO L273 TraceCheckUtils]: 30: Hoare triple {748#false} assume !false; {748#false} is VALID [2018-11-23 10:02:38,010 INFO L273 TraceCheckUtils]: 29: Hoare triple {748#false} assume 0bv32 == ~cond; {748#false} is VALID [2018-11-23 10:02:38,010 INFO L273 TraceCheckUtils]: 28: Hoare triple {748#false} ~cond := #in~cond; {748#false} is VALID [2018-11-23 10:02:38,010 INFO L256 TraceCheckUtils]: 27: Hoare triple {748#false} call __VERIFIER_assert((if #t~mem19 == #t~mem20 then 1bv32 else 0bv32)); {748#false} is VALID [2018-11-23 10:02:38,011 INFO L273 TraceCheckUtils]: 26: Hoare triple {748#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem19 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem20 := read~intINTTYPE4(~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {748#false} is VALID [2018-11-23 10:02:38,011 INFO L273 TraceCheckUtils]: 25: Hoare triple {748#false} havoc ~x~0;~x~0 := 0bv32; {748#false} is VALID [2018-11-23 10:02:38,011 INFO L273 TraceCheckUtils]: 24: Hoare triple {748#false} assume !~bvslt32(~i~0, 100000bv32); {748#false} is VALID [2018-11-23 10:02:38,011 INFO L273 TraceCheckUtils]: 23: Hoare triple {748#false} ~i~0 := 0bv32; {748#false} is VALID [2018-11-23 10:02:38,012 INFO L273 TraceCheckUtils]: 22: Hoare triple {748#false} assume !~bvslt32(~i~0, 100000bv32); {748#false} is VALID [2018-11-23 10:02:38,012 INFO L273 TraceCheckUtils]: 21: Hoare triple {748#false} ~i~0 := 0bv32; {748#false} is VALID [2018-11-23 10:02:38,012 INFO L273 TraceCheckUtils]: 20: Hoare triple {748#false} assume !~bvslt32(~i~0, 100000bv32); {748#false} is VALID [2018-11-23 10:02:38,012 INFO L273 TraceCheckUtils]: 19: Hoare triple {748#false} ~i~0 := 0bv32; {748#false} is VALID [2018-11-23 10:02:38,013 INFO L273 TraceCheckUtils]: 18: Hoare triple {748#false} assume !~bvslt32(~i~0, 100000bv32); {748#false} is VALID [2018-11-23 10:02:38,013 INFO L273 TraceCheckUtils]: 17: Hoare triple {748#false} ~i~0 := 0bv32; {748#false} is VALID [2018-11-23 10:02:38,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {748#false} assume !~bvslt32(~i~0, 100000bv32); {748#false} is VALID [2018-11-23 10:02:38,013 INFO L273 TraceCheckUtils]: 15: Hoare triple {748#false} ~i~0 := 0bv32; {748#false} is VALID [2018-11-23 10:02:38,014 INFO L273 TraceCheckUtils]: 14: Hoare triple {748#false} assume !~bvslt32(~i~0, 100000bv32); {748#false} is VALID [2018-11-23 10:02:38,014 INFO L273 TraceCheckUtils]: 13: Hoare triple {748#false} ~i~0 := 0bv32; {748#false} is VALID [2018-11-23 10:02:38,014 INFO L273 TraceCheckUtils]: 12: Hoare triple {748#false} assume !~bvslt32(~i~0, 100000bv32); {748#false} is VALID [2018-11-23 10:02:38,015 INFO L273 TraceCheckUtils]: 11: Hoare triple {748#false} ~i~0 := 0bv32; {748#false} is VALID [2018-11-23 10:02:38,015 INFO L273 TraceCheckUtils]: 10: Hoare triple {748#false} assume !~bvslt32(~i~0, 100000bv32); {748#false} is VALID [2018-11-23 10:02:38,015 INFO L273 TraceCheckUtils]: 9: Hoare triple {748#false} havoc ~i~0;~i~0 := 0bv32; {748#false} is VALID [2018-11-23 10:02:38,019 INFO L273 TraceCheckUtils]: 8: Hoare triple {910#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {748#false} is VALID [2018-11-23 10:02:38,020 INFO L273 TraceCheckUtils]: 7: Hoare triple {914#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {910#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:38,022 INFO L273 TraceCheckUtils]: 6: Hoare triple {914#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {914#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,024 INFO L273 TraceCheckUtils]: 5: Hoare triple {747#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {914#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,025 INFO L256 TraceCheckUtils]: 4: Hoare triple {747#true} call #t~ret21 := main(); {747#true} is VALID [2018-11-23 10:02:38,025 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {747#true} {747#true} #161#return; {747#true} is VALID [2018-11-23 10:02:38,026 INFO L273 TraceCheckUtils]: 2: Hoare triple {747#true} assume true; {747#true} is VALID [2018-11-23 10:02:38,026 INFO L273 TraceCheckUtils]: 1: Hoare triple {747#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {747#true} is VALID [2018-11-23 10:02:38,026 INFO L256 TraceCheckUtils]: 0: Hoare triple {747#true} call ULTIMATE.init(); {747#true} is VALID [2018-11-23 10:02:38,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:38,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:38,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:02:38,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-23 10:02:38,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:38,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:02:38,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:38,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:02:38,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:02:38,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:02:38,096 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 6 states. [2018-11-23 10:02:38,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:38,558 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2018-11-23 10:02:38,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:02:38,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-23 10:02:38,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:38,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:38,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2018-11-23 10:02:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2018-11-23 10:02:38,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 105 transitions. [2018-11-23 10:02:38,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:38,794 INFO L225 Difference]: With dead ends: 85 [2018-11-23 10:02:38,794 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 10:02:38,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:02:38,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 10:02:38,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-23 10:02:38,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:38,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-23 10:02:38,856 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 10:02:38,856 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 10:02:38,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:38,859 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2018-11-23 10:02:38,859 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-11-23 10:02:38,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:38,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:38,860 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 10:02:38,860 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 10:02:38,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:38,863 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2018-11-23 10:02:38,863 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-11-23 10:02:38,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:38,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:38,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:38,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 10:02:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2018-11-23 10:02:38,868 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 31 [2018-11-23 10:02:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:38,869 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2018-11-23 10:02:38,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:02:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-11-23 10:02:38,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 10:02:38,871 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:38,871 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:38,871 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:38,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:38,872 INFO L82 PathProgramCache]: Analyzing trace with hash 165386122, now seen corresponding path program 2 times [2018-11-23 10:02:38,872 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:38,872 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:38,902 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:02:38,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 10:02:38,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:38,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:39,114 INFO L256 TraceCheckUtils]: 0: Hoare triple {1226#true} call ULTIMATE.init(); {1226#true} is VALID [2018-11-23 10:02:39,114 INFO L273 TraceCheckUtils]: 1: Hoare triple {1226#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1226#true} is VALID [2018-11-23 10:02:39,115 INFO L273 TraceCheckUtils]: 2: Hoare triple {1226#true} assume true; {1226#true} is VALID [2018-11-23 10:02:39,115 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1226#true} {1226#true} #161#return; {1226#true} is VALID [2018-11-23 10:02:39,115 INFO L256 TraceCheckUtils]: 4: Hoare triple {1226#true} call #t~ret21 := main(); {1226#true} is VALID [2018-11-23 10:02:39,115 INFO L273 TraceCheckUtils]: 5: Hoare triple {1226#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1226#true} is VALID [2018-11-23 10:02:39,116 INFO L273 TraceCheckUtils]: 6: Hoare triple {1226#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1226#true} is VALID [2018-11-23 10:02:39,116 INFO L273 TraceCheckUtils]: 7: Hoare triple {1226#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1226#true} is VALID [2018-11-23 10:02:39,117 INFO L273 TraceCheckUtils]: 8: Hoare triple {1226#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1226#true} is VALID [2018-11-23 10:02:39,117 INFO L273 TraceCheckUtils]: 9: Hoare triple {1226#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1226#true} is VALID [2018-11-23 10:02:39,117 INFO L273 TraceCheckUtils]: 10: Hoare triple {1226#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1226#true} is VALID [2018-11-23 10:02:39,117 INFO L273 TraceCheckUtils]: 11: Hoare triple {1226#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1226#true} is VALID [2018-11-23 10:02:39,118 INFO L273 TraceCheckUtils]: 12: Hoare triple {1226#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1226#true} is VALID [2018-11-23 10:02:39,118 INFO L273 TraceCheckUtils]: 13: Hoare triple {1226#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1226#true} is VALID [2018-11-23 10:02:39,118 INFO L273 TraceCheckUtils]: 14: Hoare triple {1226#true} assume !~bvslt32(~a~0, 100000bv32); {1226#true} is VALID [2018-11-23 10:02:39,129 INFO L273 TraceCheckUtils]: 15: Hoare triple {1226#true} havoc ~i~0;~i~0 := 0bv32; {1276#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:39,134 INFO L273 TraceCheckUtils]: 16: Hoare triple {1276#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1227#false} is VALID [2018-11-23 10:02:39,134 INFO L273 TraceCheckUtils]: 17: Hoare triple {1227#false} ~i~0 := 0bv32; {1227#false} is VALID [2018-11-23 10:02:39,134 INFO L273 TraceCheckUtils]: 18: Hoare triple {1227#false} assume !~bvslt32(~i~0, 100000bv32); {1227#false} is VALID [2018-11-23 10:02:39,135 INFO L273 TraceCheckUtils]: 19: Hoare triple {1227#false} ~i~0 := 0bv32; {1227#false} is VALID [2018-11-23 10:02:39,135 INFO L273 TraceCheckUtils]: 20: Hoare triple {1227#false} assume !~bvslt32(~i~0, 100000bv32); {1227#false} is VALID [2018-11-23 10:02:39,135 INFO L273 TraceCheckUtils]: 21: Hoare triple {1227#false} ~i~0 := 0bv32; {1227#false} is VALID [2018-11-23 10:02:39,135 INFO L273 TraceCheckUtils]: 22: Hoare triple {1227#false} assume !~bvslt32(~i~0, 100000bv32); {1227#false} is VALID [2018-11-23 10:02:39,136 INFO L273 TraceCheckUtils]: 23: Hoare triple {1227#false} ~i~0 := 0bv32; {1227#false} is VALID [2018-11-23 10:02:39,136 INFO L273 TraceCheckUtils]: 24: Hoare triple {1227#false} assume !~bvslt32(~i~0, 100000bv32); {1227#false} is VALID [2018-11-23 10:02:39,136 INFO L273 TraceCheckUtils]: 25: Hoare triple {1227#false} ~i~0 := 0bv32; {1227#false} is VALID [2018-11-23 10:02:39,137 INFO L273 TraceCheckUtils]: 26: Hoare triple {1227#false} assume !~bvslt32(~i~0, 100000bv32); {1227#false} is VALID [2018-11-23 10:02:39,137 INFO L273 TraceCheckUtils]: 27: Hoare triple {1227#false} ~i~0 := 0bv32; {1227#false} is VALID [2018-11-23 10:02:39,137 INFO L273 TraceCheckUtils]: 28: Hoare triple {1227#false} assume !~bvslt32(~i~0, 100000bv32); {1227#false} is VALID [2018-11-23 10:02:39,138 INFO L273 TraceCheckUtils]: 29: Hoare triple {1227#false} ~i~0 := 0bv32; {1227#false} is VALID [2018-11-23 10:02:39,138 INFO L273 TraceCheckUtils]: 30: Hoare triple {1227#false} assume !~bvslt32(~i~0, 100000bv32); {1227#false} is VALID [2018-11-23 10:02:39,138 INFO L273 TraceCheckUtils]: 31: Hoare triple {1227#false} havoc ~x~0;~x~0 := 0bv32; {1227#false} is VALID [2018-11-23 10:02:39,138 INFO L273 TraceCheckUtils]: 32: Hoare triple {1227#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem19 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem20 := read~intINTTYPE4(~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1227#false} is VALID [2018-11-23 10:02:39,139 INFO L256 TraceCheckUtils]: 33: Hoare triple {1227#false} call __VERIFIER_assert((if #t~mem19 == #t~mem20 then 1bv32 else 0bv32)); {1227#false} is VALID [2018-11-23 10:02:39,139 INFO L273 TraceCheckUtils]: 34: Hoare triple {1227#false} ~cond := #in~cond; {1227#false} is VALID [2018-11-23 10:02:39,139 INFO L273 TraceCheckUtils]: 35: Hoare triple {1227#false} assume 0bv32 == ~cond; {1227#false} is VALID [2018-11-23 10:02:39,140 INFO L273 TraceCheckUtils]: 36: Hoare triple {1227#false} assume !false; {1227#false} is VALID [2018-11-23 10:02:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 10:02:39,142 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:39,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:39,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:02:39,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 10:02:39,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:39,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:02:39,206 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:39,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:02:39,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:02:39,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:39,207 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 3 states. [2018-11-23 10:02:39,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:39,598 INFO L93 Difference]: Finished difference Result 98 states and 122 transitions. [2018-11-23 10:02:39,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:02:39,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 10:02:39,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:39,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2018-11-23 10:02:39,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2018-11-23 10:02:39,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 115 transitions. [2018-11-23 10:02:39,796 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:39,800 INFO L225 Difference]: With dead ends: 98 [2018-11-23 10:02:39,800 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 10:02:39,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:39,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 10:02:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2018-11-23 10:02:39,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:39,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 58 states. [2018-11-23 10:02:39,837 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 58 states. [2018-11-23 10:02:39,837 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 58 states. [2018-11-23 10:02:39,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:39,841 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-11-23 10:02:39,841 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-11-23 10:02:39,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:39,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:39,842 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 66 states. [2018-11-23 10:02:39,843 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 66 states. [2018-11-23 10:02:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:39,846 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-11-23 10:02:39,846 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-11-23 10:02:39,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:39,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:39,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:39,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:39,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 10:02:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2018-11-23 10:02:39,851 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 37 [2018-11-23 10:02:39,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:39,851 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2018-11-23 10:02:39,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:02:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2018-11-23 10:02:39,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 10:02:39,853 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:39,853 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:39,853 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:39,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:39,854 INFO L82 PathProgramCache]: Analyzing trace with hash -315181702, now seen corresponding path program 1 times [2018-11-23 10:02:39,854 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:39,854 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:39,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:02:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:39,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:40,121 INFO L256 TraceCheckUtils]: 0: Hoare triple {1693#true} call ULTIMATE.init(); {1693#true} is VALID [2018-11-23 10:02:40,121 INFO L273 TraceCheckUtils]: 1: Hoare triple {1693#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1693#true} is VALID [2018-11-23 10:02:40,122 INFO L273 TraceCheckUtils]: 2: Hoare triple {1693#true} assume true; {1693#true} is VALID [2018-11-23 10:02:40,122 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1693#true} {1693#true} #161#return; {1693#true} is VALID [2018-11-23 10:02:40,122 INFO L256 TraceCheckUtils]: 4: Hoare triple {1693#true} call #t~ret21 := main(); {1693#true} is VALID [2018-11-23 10:02:40,123 INFO L273 TraceCheckUtils]: 5: Hoare triple {1693#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1713#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:40,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {1713#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1713#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:40,124 INFO L273 TraceCheckUtils]: 7: Hoare triple {1713#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1720#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:40,124 INFO L273 TraceCheckUtils]: 8: Hoare triple {1720#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1720#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:40,126 INFO L273 TraceCheckUtils]: 9: Hoare triple {1720#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1727#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:40,126 INFO L273 TraceCheckUtils]: 10: Hoare triple {1727#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1727#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:40,127 INFO L273 TraceCheckUtils]: 11: Hoare triple {1727#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1734#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:40,128 INFO L273 TraceCheckUtils]: 12: Hoare triple {1734#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1734#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:40,129 INFO L273 TraceCheckUtils]: 13: Hoare triple {1734#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1741#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:40,130 INFO L273 TraceCheckUtils]: 14: Hoare triple {1741#(= (_ bv4 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1694#false} is VALID [2018-11-23 10:02:40,130 INFO L273 TraceCheckUtils]: 15: Hoare triple {1694#false} havoc ~i~0;~i~0 := 0bv32; {1694#false} is VALID [2018-11-23 10:02:40,131 INFO L273 TraceCheckUtils]: 16: Hoare triple {1694#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1694#false} is VALID [2018-11-23 10:02:40,131 INFO L273 TraceCheckUtils]: 17: Hoare triple {1694#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1694#false} is VALID [2018-11-23 10:02:40,132 INFO L273 TraceCheckUtils]: 18: Hoare triple {1694#false} assume !~bvslt32(~i~0, 100000bv32); {1694#false} is VALID [2018-11-23 10:02:40,132 INFO L273 TraceCheckUtils]: 19: Hoare triple {1694#false} ~i~0 := 0bv32; {1694#false} is VALID [2018-11-23 10:02:40,132 INFO L273 TraceCheckUtils]: 20: Hoare triple {1694#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {1694#false} is VALID [2018-11-23 10:02:40,132 INFO L273 TraceCheckUtils]: 21: Hoare triple {1694#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1694#false} is VALID [2018-11-23 10:02:40,133 INFO L273 TraceCheckUtils]: 22: Hoare triple {1694#false} assume !~bvslt32(~i~0, 100000bv32); {1694#false} is VALID [2018-11-23 10:02:40,133 INFO L273 TraceCheckUtils]: 23: Hoare triple {1694#false} ~i~0 := 0bv32; {1694#false} is VALID [2018-11-23 10:02:40,133 INFO L273 TraceCheckUtils]: 24: Hoare triple {1694#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {1694#false} is VALID [2018-11-23 10:02:40,133 INFO L273 TraceCheckUtils]: 25: Hoare triple {1694#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1694#false} is VALID [2018-11-23 10:02:40,134 INFO L273 TraceCheckUtils]: 26: Hoare triple {1694#false} assume !~bvslt32(~i~0, 100000bv32); {1694#false} is VALID [2018-11-23 10:02:40,134 INFO L273 TraceCheckUtils]: 27: Hoare triple {1694#false} ~i~0 := 0bv32; {1694#false} is VALID [2018-11-23 10:02:40,134 INFO L273 TraceCheckUtils]: 28: Hoare triple {1694#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {1694#false} is VALID [2018-11-23 10:02:40,134 INFO L273 TraceCheckUtils]: 29: Hoare triple {1694#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {1694#false} is VALID [2018-11-23 10:02:40,134 INFO L273 TraceCheckUtils]: 30: Hoare triple {1694#false} assume !~bvslt32(~i~0, 100000bv32); {1694#false} is VALID [2018-11-23 10:02:40,135 INFO L273 TraceCheckUtils]: 31: Hoare triple {1694#false} ~i~0 := 0bv32; {1694#false} is VALID [2018-11-23 10:02:40,135 INFO L273 TraceCheckUtils]: 32: Hoare triple {1694#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {1694#false} is VALID [2018-11-23 10:02:40,135 INFO L273 TraceCheckUtils]: 33: Hoare triple {1694#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {1694#false} is VALID [2018-11-23 10:02:40,136 INFO L273 TraceCheckUtils]: 34: Hoare triple {1694#false} assume !~bvslt32(~i~0, 100000bv32); {1694#false} is VALID [2018-11-23 10:02:40,136 INFO L273 TraceCheckUtils]: 35: Hoare triple {1694#false} ~i~0 := 0bv32; {1694#false} is VALID [2018-11-23 10:02:40,136 INFO L273 TraceCheckUtils]: 36: Hoare triple {1694#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {1694#false} is VALID [2018-11-23 10:02:40,137 INFO L273 TraceCheckUtils]: 37: Hoare triple {1694#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {1694#false} is VALID [2018-11-23 10:02:40,137 INFO L273 TraceCheckUtils]: 38: Hoare triple {1694#false} assume !~bvslt32(~i~0, 100000bv32); {1694#false} is VALID [2018-11-23 10:02:40,137 INFO L273 TraceCheckUtils]: 39: Hoare triple {1694#false} ~i~0 := 0bv32; {1694#false} is VALID [2018-11-23 10:02:40,137 INFO L273 TraceCheckUtils]: 40: Hoare triple {1694#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {1694#false} is VALID [2018-11-23 10:02:40,138 INFO L273 TraceCheckUtils]: 41: Hoare triple {1694#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1694#false} is VALID [2018-11-23 10:02:40,138 INFO L273 TraceCheckUtils]: 42: Hoare triple {1694#false} assume !~bvslt32(~i~0, 100000bv32); {1694#false} is VALID [2018-11-23 10:02:40,138 INFO L273 TraceCheckUtils]: 43: Hoare triple {1694#false} ~i~0 := 0bv32; {1694#false} is VALID [2018-11-23 10:02:40,139 INFO L273 TraceCheckUtils]: 44: Hoare triple {1694#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem17, ~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem17; {1694#false} is VALID [2018-11-23 10:02:40,139 INFO L273 TraceCheckUtils]: 45: Hoare triple {1694#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {1694#false} is VALID [2018-11-23 10:02:40,139 INFO L273 TraceCheckUtils]: 46: Hoare triple {1694#false} assume !~bvslt32(~i~0, 100000bv32); {1694#false} is VALID [2018-11-23 10:02:40,140 INFO L273 TraceCheckUtils]: 47: Hoare triple {1694#false} havoc ~x~0;~x~0 := 0bv32; {1694#false} is VALID [2018-11-23 10:02:40,140 INFO L273 TraceCheckUtils]: 48: Hoare triple {1694#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem19 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem20 := read~intINTTYPE4(~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1694#false} is VALID [2018-11-23 10:02:40,140 INFO L256 TraceCheckUtils]: 49: Hoare triple {1694#false} call __VERIFIER_assert((if #t~mem19 == #t~mem20 then 1bv32 else 0bv32)); {1694#false} is VALID [2018-11-23 10:02:40,140 INFO L273 TraceCheckUtils]: 50: Hoare triple {1694#false} ~cond := #in~cond; {1694#false} is VALID [2018-11-23 10:02:40,141 INFO L273 TraceCheckUtils]: 51: Hoare triple {1694#false} assume 0bv32 == ~cond; {1694#false} is VALID [2018-11-23 10:02:40,141 INFO L273 TraceCheckUtils]: 52: Hoare triple {1694#false} assume !false; {1694#false} is VALID [2018-11-23 10:02:40,145 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 10:02:40,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:40,372 INFO L273 TraceCheckUtils]: 52: Hoare triple {1694#false} assume !false; {1694#false} is VALID [2018-11-23 10:02:40,372 INFO L273 TraceCheckUtils]: 51: Hoare triple {1694#false} assume 0bv32 == ~cond; {1694#false} is VALID [2018-11-23 10:02:40,373 INFO L273 TraceCheckUtils]: 50: Hoare triple {1694#false} ~cond := #in~cond; {1694#false} is VALID [2018-11-23 10:02:40,373 INFO L256 TraceCheckUtils]: 49: Hoare triple {1694#false} call __VERIFIER_assert((if #t~mem19 == #t~mem20 then 1bv32 else 0bv32)); {1694#false} is VALID [2018-11-23 10:02:40,373 INFO L273 TraceCheckUtils]: 48: Hoare triple {1694#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem19 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem20 := read~intINTTYPE4(~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1694#false} is VALID [2018-11-23 10:02:40,373 INFO L273 TraceCheckUtils]: 47: Hoare triple {1694#false} havoc ~x~0;~x~0 := 0bv32; {1694#false} is VALID [2018-11-23 10:02:40,374 INFO L273 TraceCheckUtils]: 46: Hoare triple {1694#false} assume !~bvslt32(~i~0, 100000bv32); {1694#false} is VALID [2018-11-23 10:02:40,374 INFO L273 TraceCheckUtils]: 45: Hoare triple {1694#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {1694#false} is VALID [2018-11-23 10:02:40,374 INFO L273 TraceCheckUtils]: 44: Hoare triple {1694#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem17, ~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem17; {1694#false} is VALID [2018-11-23 10:02:40,374 INFO L273 TraceCheckUtils]: 43: Hoare triple {1694#false} ~i~0 := 0bv32; {1694#false} is VALID [2018-11-23 10:02:40,374 INFO L273 TraceCheckUtils]: 42: Hoare triple {1694#false} assume !~bvslt32(~i~0, 100000bv32); {1694#false} is VALID [2018-11-23 10:02:40,375 INFO L273 TraceCheckUtils]: 41: Hoare triple {1694#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1694#false} is VALID [2018-11-23 10:02:40,375 INFO L273 TraceCheckUtils]: 40: Hoare triple {1694#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {1694#false} is VALID [2018-11-23 10:02:40,375 INFO L273 TraceCheckUtils]: 39: Hoare triple {1694#false} ~i~0 := 0bv32; {1694#false} is VALID [2018-11-23 10:02:40,375 INFO L273 TraceCheckUtils]: 38: Hoare triple {1694#false} assume !~bvslt32(~i~0, 100000bv32); {1694#false} is VALID [2018-11-23 10:02:40,376 INFO L273 TraceCheckUtils]: 37: Hoare triple {1694#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {1694#false} is VALID [2018-11-23 10:02:40,376 INFO L273 TraceCheckUtils]: 36: Hoare triple {1694#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {1694#false} is VALID [2018-11-23 10:02:40,376 INFO L273 TraceCheckUtils]: 35: Hoare triple {1694#false} ~i~0 := 0bv32; {1694#false} is VALID [2018-11-23 10:02:40,377 INFO L273 TraceCheckUtils]: 34: Hoare triple {1694#false} assume !~bvslt32(~i~0, 100000bv32); {1694#false} is VALID [2018-11-23 10:02:40,377 INFO L273 TraceCheckUtils]: 33: Hoare triple {1694#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {1694#false} is VALID [2018-11-23 10:02:40,377 INFO L273 TraceCheckUtils]: 32: Hoare triple {1694#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {1694#false} is VALID [2018-11-23 10:02:40,377 INFO L273 TraceCheckUtils]: 31: Hoare triple {1694#false} ~i~0 := 0bv32; {1694#false} is VALID [2018-11-23 10:02:40,378 INFO L273 TraceCheckUtils]: 30: Hoare triple {1694#false} assume !~bvslt32(~i~0, 100000bv32); {1694#false} is VALID [2018-11-23 10:02:40,378 INFO L273 TraceCheckUtils]: 29: Hoare triple {1694#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {1694#false} is VALID [2018-11-23 10:02:40,378 INFO L273 TraceCheckUtils]: 28: Hoare triple {1694#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {1694#false} is VALID [2018-11-23 10:02:40,378 INFO L273 TraceCheckUtils]: 27: Hoare triple {1694#false} ~i~0 := 0bv32; {1694#false} is VALID [2018-11-23 10:02:40,379 INFO L273 TraceCheckUtils]: 26: Hoare triple {1694#false} assume !~bvslt32(~i~0, 100000bv32); {1694#false} is VALID [2018-11-23 10:02:40,379 INFO L273 TraceCheckUtils]: 25: Hoare triple {1694#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1694#false} is VALID [2018-11-23 10:02:40,379 INFO L273 TraceCheckUtils]: 24: Hoare triple {1694#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {1694#false} is VALID [2018-11-23 10:02:40,379 INFO L273 TraceCheckUtils]: 23: Hoare triple {1694#false} ~i~0 := 0bv32; {1694#false} is VALID [2018-11-23 10:02:40,379 INFO L273 TraceCheckUtils]: 22: Hoare triple {1694#false} assume !~bvslt32(~i~0, 100000bv32); {1694#false} is VALID [2018-11-23 10:02:40,380 INFO L273 TraceCheckUtils]: 21: Hoare triple {1694#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1694#false} is VALID [2018-11-23 10:02:40,380 INFO L273 TraceCheckUtils]: 20: Hoare triple {1694#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {1694#false} is VALID [2018-11-23 10:02:40,380 INFO L273 TraceCheckUtils]: 19: Hoare triple {1694#false} ~i~0 := 0bv32; {1694#false} is VALID [2018-11-23 10:02:40,380 INFO L273 TraceCheckUtils]: 18: Hoare triple {1694#false} assume !~bvslt32(~i~0, 100000bv32); {1694#false} is VALID [2018-11-23 10:02:40,380 INFO L273 TraceCheckUtils]: 17: Hoare triple {1694#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1694#false} is VALID [2018-11-23 10:02:40,381 INFO L273 TraceCheckUtils]: 16: Hoare triple {1694#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1694#false} is VALID [2018-11-23 10:02:40,381 INFO L273 TraceCheckUtils]: 15: Hoare triple {1694#false} havoc ~i~0;~i~0 := 0bv32; {1694#false} is VALID [2018-11-23 10:02:40,381 INFO L273 TraceCheckUtils]: 14: Hoare triple {1973#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1694#false} is VALID [2018-11-23 10:02:40,383 INFO L273 TraceCheckUtils]: 13: Hoare triple {1977#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1973#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:40,383 INFO L273 TraceCheckUtils]: 12: Hoare triple {1977#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1977#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,388 INFO L273 TraceCheckUtils]: 11: Hoare triple {1984#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1977#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,389 INFO L273 TraceCheckUtils]: 10: Hoare triple {1984#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1984#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,396 INFO L273 TraceCheckUtils]: 9: Hoare triple {1991#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1984#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,398 INFO L273 TraceCheckUtils]: 8: Hoare triple {1991#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1991#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,406 INFO L273 TraceCheckUtils]: 7: Hoare triple {1998#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1991#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,409 INFO L273 TraceCheckUtils]: 6: Hoare triple {1998#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1998#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,411 INFO L273 TraceCheckUtils]: 5: Hoare triple {1693#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1998#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,412 INFO L256 TraceCheckUtils]: 4: Hoare triple {1693#true} call #t~ret21 := main(); {1693#true} is VALID [2018-11-23 10:02:40,412 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1693#true} {1693#true} #161#return; {1693#true} is VALID [2018-11-23 10:02:40,412 INFO L273 TraceCheckUtils]: 2: Hoare triple {1693#true} assume true; {1693#true} is VALID [2018-11-23 10:02:40,413 INFO L273 TraceCheckUtils]: 1: Hoare triple {1693#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1693#true} is VALID [2018-11-23 10:02:40,413 INFO L256 TraceCheckUtils]: 0: Hoare triple {1693#true} call ULTIMATE.init(); {1693#true} is VALID [2018-11-23 10:02:40,417 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 10:02:40,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:40,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:02:40,424 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-23 10:02:40,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:40,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:02:40,563 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:40,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:02:40,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:02:40,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:02:40,565 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand 12 states. [2018-11-23 10:02:41,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:41,789 INFO L93 Difference]: Finished difference Result 113 states and 136 transitions. [2018-11-23 10:02:41,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:02:41,789 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-23 10:02:41,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:41,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:02:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 120 transitions. [2018-11-23 10:02:41,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:02:41,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 120 transitions. [2018-11-23 10:02:41,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 120 transitions. [2018-11-23 10:02:42,053 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:42,056 INFO L225 Difference]: With dead ends: 113 [2018-11-23 10:02:42,057 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 10:02:42,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:02:42,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 10:02:42,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-23 10:02:42,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:42,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2018-11-23 10:02:42,096 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-23 10:02:42,096 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-23 10:02:42,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:42,100 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-11-23 10:02:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2018-11-23 10:02:42,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:42,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:42,101 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-23 10:02:42,101 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-23 10:02:42,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:42,104 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-11-23 10:02:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2018-11-23 10:02:42,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:42,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:42,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:42,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:42,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 10:02:42,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2018-11-23 10:02:42,109 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 53 [2018-11-23 10:02:42,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:42,109 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2018-11-23 10:02:42,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:02:42,109 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2018-11-23 10:02:42,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 10:02:42,111 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:42,111 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:42,111 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:42,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:42,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1285113774, now seen corresponding path program 2 times [2018-11-23 10:02:42,112 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:42,112 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:42,134 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:02:42,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:02:42,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:42,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:42,597 INFO L256 TraceCheckUtils]: 0: Hoare triple {2440#true} call ULTIMATE.init(); {2440#true} is VALID [2018-11-23 10:02:42,598 INFO L273 TraceCheckUtils]: 1: Hoare triple {2440#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2440#true} is VALID [2018-11-23 10:02:42,598 INFO L273 TraceCheckUtils]: 2: Hoare triple {2440#true} assume true; {2440#true} is VALID [2018-11-23 10:02:42,599 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2440#true} {2440#true} #161#return; {2440#true} is VALID [2018-11-23 10:02:42,599 INFO L256 TraceCheckUtils]: 4: Hoare triple {2440#true} call #t~ret21 := main(); {2440#true} is VALID [2018-11-23 10:02:42,600 INFO L273 TraceCheckUtils]: 5: Hoare triple {2440#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2460#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:42,601 INFO L273 TraceCheckUtils]: 6: Hoare triple {2460#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2460#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:42,601 INFO L273 TraceCheckUtils]: 7: Hoare triple {2460#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2467#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:42,602 INFO L273 TraceCheckUtils]: 8: Hoare triple {2467#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2467#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:42,602 INFO L273 TraceCheckUtils]: 9: Hoare triple {2467#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2474#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:42,603 INFO L273 TraceCheckUtils]: 10: Hoare triple {2474#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2474#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:42,603 INFO L273 TraceCheckUtils]: 11: Hoare triple {2474#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2481#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:42,604 INFO L273 TraceCheckUtils]: 12: Hoare triple {2481#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2481#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:42,605 INFO L273 TraceCheckUtils]: 13: Hoare triple {2481#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2488#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:42,606 INFO L273 TraceCheckUtils]: 14: Hoare triple {2488#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2488#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:42,606 INFO L273 TraceCheckUtils]: 15: Hoare triple {2488#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2495#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:42,607 INFO L273 TraceCheckUtils]: 16: Hoare triple {2495#(= (_ bv5 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2495#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:42,608 INFO L273 TraceCheckUtils]: 17: Hoare triple {2495#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2502#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:42,609 INFO L273 TraceCheckUtils]: 18: Hoare triple {2502#(= (_ bv6 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2502#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:42,609 INFO L273 TraceCheckUtils]: 19: Hoare triple {2502#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2509#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:42,610 INFO L273 TraceCheckUtils]: 20: Hoare triple {2509#(= (_ bv7 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2509#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:42,611 INFO L273 TraceCheckUtils]: 21: Hoare triple {2509#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2516#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:42,612 INFO L273 TraceCheckUtils]: 22: Hoare triple {2516#(= (_ bv8 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2516#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:42,613 INFO L273 TraceCheckUtils]: 23: Hoare triple {2516#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2523#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:42,616 INFO L273 TraceCheckUtils]: 24: Hoare triple {2523#(= (_ bv9 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2523#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:42,616 INFO L273 TraceCheckUtils]: 25: Hoare triple {2523#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2530#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 10:02:42,617 INFO L273 TraceCheckUtils]: 26: Hoare triple {2530#(= (_ bv10 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {2441#false} is VALID [2018-11-23 10:02:42,617 INFO L273 TraceCheckUtils]: 27: Hoare triple {2441#false} havoc ~i~0;~i~0 := 0bv32; {2441#false} is VALID [2018-11-23 10:02:42,617 INFO L273 TraceCheckUtils]: 28: Hoare triple {2441#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2441#false} is VALID [2018-11-23 10:02:42,617 INFO L273 TraceCheckUtils]: 29: Hoare triple {2441#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2441#false} is VALID [2018-11-23 10:02:42,618 INFO L273 TraceCheckUtils]: 30: Hoare triple {2441#false} assume !~bvslt32(~i~0, 100000bv32); {2441#false} is VALID [2018-11-23 10:02:42,618 INFO L273 TraceCheckUtils]: 31: Hoare triple {2441#false} ~i~0 := 0bv32; {2441#false} is VALID [2018-11-23 10:02:42,618 INFO L273 TraceCheckUtils]: 32: Hoare triple {2441#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2441#false} is VALID [2018-11-23 10:02:42,618 INFO L273 TraceCheckUtils]: 33: Hoare triple {2441#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2441#false} is VALID [2018-11-23 10:02:42,619 INFO L273 TraceCheckUtils]: 34: Hoare triple {2441#false} assume !~bvslt32(~i~0, 100000bv32); {2441#false} is VALID [2018-11-23 10:02:42,619 INFO L273 TraceCheckUtils]: 35: Hoare triple {2441#false} ~i~0 := 0bv32; {2441#false} is VALID [2018-11-23 10:02:42,619 INFO L273 TraceCheckUtils]: 36: Hoare triple {2441#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {2441#false} is VALID [2018-11-23 10:02:42,619 INFO L273 TraceCheckUtils]: 37: Hoare triple {2441#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2441#false} is VALID [2018-11-23 10:02:42,620 INFO L273 TraceCheckUtils]: 38: Hoare triple {2441#false} assume !~bvslt32(~i~0, 100000bv32); {2441#false} is VALID [2018-11-23 10:02:42,620 INFO L273 TraceCheckUtils]: 39: Hoare triple {2441#false} ~i~0 := 0bv32; {2441#false} is VALID [2018-11-23 10:02:42,620 INFO L273 TraceCheckUtils]: 40: Hoare triple {2441#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {2441#false} is VALID [2018-11-23 10:02:42,620 INFO L273 TraceCheckUtils]: 41: Hoare triple {2441#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {2441#false} is VALID [2018-11-23 10:02:42,621 INFO L273 TraceCheckUtils]: 42: Hoare triple {2441#false} assume !~bvslt32(~i~0, 100000bv32); {2441#false} is VALID [2018-11-23 10:02:42,621 INFO L273 TraceCheckUtils]: 43: Hoare triple {2441#false} ~i~0 := 0bv32; {2441#false} is VALID [2018-11-23 10:02:42,621 INFO L273 TraceCheckUtils]: 44: Hoare triple {2441#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {2441#false} is VALID [2018-11-23 10:02:42,621 INFO L273 TraceCheckUtils]: 45: Hoare triple {2441#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {2441#false} is VALID [2018-11-23 10:02:42,622 INFO L273 TraceCheckUtils]: 46: Hoare triple {2441#false} assume !~bvslt32(~i~0, 100000bv32); {2441#false} is VALID [2018-11-23 10:02:42,622 INFO L273 TraceCheckUtils]: 47: Hoare triple {2441#false} ~i~0 := 0bv32; {2441#false} is VALID [2018-11-23 10:02:42,622 INFO L273 TraceCheckUtils]: 48: Hoare triple {2441#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {2441#false} is VALID [2018-11-23 10:02:42,622 INFO L273 TraceCheckUtils]: 49: Hoare triple {2441#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2441#false} is VALID [2018-11-23 10:02:42,623 INFO L273 TraceCheckUtils]: 50: Hoare triple {2441#false} assume !~bvslt32(~i~0, 100000bv32); {2441#false} is VALID [2018-11-23 10:02:42,623 INFO L273 TraceCheckUtils]: 51: Hoare triple {2441#false} ~i~0 := 0bv32; {2441#false} is VALID [2018-11-23 10:02:42,623 INFO L273 TraceCheckUtils]: 52: Hoare triple {2441#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {2441#false} is VALID [2018-11-23 10:02:42,623 INFO L273 TraceCheckUtils]: 53: Hoare triple {2441#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {2441#false} is VALID [2018-11-23 10:02:42,624 INFO L273 TraceCheckUtils]: 54: Hoare triple {2441#false} assume !~bvslt32(~i~0, 100000bv32); {2441#false} is VALID [2018-11-23 10:02:42,624 INFO L273 TraceCheckUtils]: 55: Hoare triple {2441#false} ~i~0 := 0bv32; {2441#false} is VALID [2018-11-23 10:02:42,624 INFO L273 TraceCheckUtils]: 56: Hoare triple {2441#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem17, ~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem17; {2441#false} is VALID [2018-11-23 10:02:42,624 INFO L273 TraceCheckUtils]: 57: Hoare triple {2441#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {2441#false} is VALID [2018-11-23 10:02:42,625 INFO L273 TraceCheckUtils]: 58: Hoare triple {2441#false} assume !~bvslt32(~i~0, 100000bv32); {2441#false} is VALID [2018-11-23 10:02:42,625 INFO L273 TraceCheckUtils]: 59: Hoare triple {2441#false} havoc ~x~0;~x~0 := 0bv32; {2441#false} is VALID [2018-11-23 10:02:42,625 INFO L273 TraceCheckUtils]: 60: Hoare triple {2441#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem19 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem20 := read~intINTTYPE4(~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2441#false} is VALID [2018-11-23 10:02:42,625 INFO L256 TraceCheckUtils]: 61: Hoare triple {2441#false} call __VERIFIER_assert((if #t~mem19 == #t~mem20 then 1bv32 else 0bv32)); {2441#false} is VALID [2018-11-23 10:02:42,625 INFO L273 TraceCheckUtils]: 62: Hoare triple {2441#false} ~cond := #in~cond; {2441#false} is VALID [2018-11-23 10:02:42,626 INFO L273 TraceCheckUtils]: 63: Hoare triple {2441#false} assume 0bv32 == ~cond; {2441#false} is VALID [2018-11-23 10:02:42,626 INFO L273 TraceCheckUtils]: 64: Hoare triple {2441#false} assume !false; {2441#false} is VALID [2018-11-23 10:02:42,630 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 10:02:42,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:43,331 INFO L273 TraceCheckUtils]: 64: Hoare triple {2441#false} assume !false; {2441#false} is VALID [2018-11-23 10:02:43,332 INFO L273 TraceCheckUtils]: 63: Hoare triple {2441#false} assume 0bv32 == ~cond; {2441#false} is VALID [2018-11-23 10:02:43,332 INFO L273 TraceCheckUtils]: 62: Hoare triple {2441#false} ~cond := #in~cond; {2441#false} is VALID [2018-11-23 10:02:43,332 INFO L256 TraceCheckUtils]: 61: Hoare triple {2441#false} call __VERIFIER_assert((if #t~mem19 == #t~mem20 then 1bv32 else 0bv32)); {2441#false} is VALID [2018-11-23 10:02:43,332 INFO L273 TraceCheckUtils]: 60: Hoare triple {2441#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem19 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem20 := read~intINTTYPE4(~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2441#false} is VALID [2018-11-23 10:02:43,332 INFO L273 TraceCheckUtils]: 59: Hoare triple {2441#false} havoc ~x~0;~x~0 := 0bv32; {2441#false} is VALID [2018-11-23 10:02:43,332 INFO L273 TraceCheckUtils]: 58: Hoare triple {2441#false} assume !~bvslt32(~i~0, 100000bv32); {2441#false} is VALID [2018-11-23 10:02:43,333 INFO L273 TraceCheckUtils]: 57: Hoare triple {2441#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {2441#false} is VALID [2018-11-23 10:02:43,333 INFO L273 TraceCheckUtils]: 56: Hoare triple {2441#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem17, ~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem17; {2441#false} is VALID [2018-11-23 10:02:43,333 INFO L273 TraceCheckUtils]: 55: Hoare triple {2441#false} ~i~0 := 0bv32; {2441#false} is VALID [2018-11-23 10:02:43,333 INFO L273 TraceCheckUtils]: 54: Hoare triple {2441#false} assume !~bvslt32(~i~0, 100000bv32); {2441#false} is VALID [2018-11-23 10:02:43,333 INFO L273 TraceCheckUtils]: 53: Hoare triple {2441#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {2441#false} is VALID [2018-11-23 10:02:43,333 INFO L273 TraceCheckUtils]: 52: Hoare triple {2441#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {2441#false} is VALID [2018-11-23 10:02:43,333 INFO L273 TraceCheckUtils]: 51: Hoare triple {2441#false} ~i~0 := 0bv32; {2441#false} is VALID [2018-11-23 10:02:43,334 INFO L273 TraceCheckUtils]: 50: Hoare triple {2441#false} assume !~bvslt32(~i~0, 100000bv32); {2441#false} is VALID [2018-11-23 10:02:43,334 INFO L273 TraceCheckUtils]: 49: Hoare triple {2441#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2441#false} is VALID [2018-11-23 10:02:43,334 INFO L273 TraceCheckUtils]: 48: Hoare triple {2441#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {2441#false} is VALID [2018-11-23 10:02:43,334 INFO L273 TraceCheckUtils]: 47: Hoare triple {2441#false} ~i~0 := 0bv32; {2441#false} is VALID [2018-11-23 10:02:43,334 INFO L273 TraceCheckUtils]: 46: Hoare triple {2441#false} assume !~bvslt32(~i~0, 100000bv32); {2441#false} is VALID [2018-11-23 10:02:43,334 INFO L273 TraceCheckUtils]: 45: Hoare triple {2441#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {2441#false} is VALID [2018-11-23 10:02:43,335 INFO L273 TraceCheckUtils]: 44: Hoare triple {2441#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {2441#false} is VALID [2018-11-23 10:02:43,335 INFO L273 TraceCheckUtils]: 43: Hoare triple {2441#false} ~i~0 := 0bv32; {2441#false} is VALID [2018-11-23 10:02:43,335 INFO L273 TraceCheckUtils]: 42: Hoare triple {2441#false} assume !~bvslt32(~i~0, 100000bv32); {2441#false} is VALID [2018-11-23 10:02:43,335 INFO L273 TraceCheckUtils]: 41: Hoare triple {2441#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {2441#false} is VALID [2018-11-23 10:02:43,335 INFO L273 TraceCheckUtils]: 40: Hoare triple {2441#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {2441#false} is VALID [2018-11-23 10:02:43,335 INFO L273 TraceCheckUtils]: 39: Hoare triple {2441#false} ~i~0 := 0bv32; {2441#false} is VALID [2018-11-23 10:02:43,336 INFO L273 TraceCheckUtils]: 38: Hoare triple {2441#false} assume !~bvslt32(~i~0, 100000bv32); {2441#false} is VALID [2018-11-23 10:02:43,336 INFO L273 TraceCheckUtils]: 37: Hoare triple {2441#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2441#false} is VALID [2018-11-23 10:02:43,336 INFO L273 TraceCheckUtils]: 36: Hoare triple {2441#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {2441#false} is VALID [2018-11-23 10:02:43,336 INFO L273 TraceCheckUtils]: 35: Hoare triple {2441#false} ~i~0 := 0bv32; {2441#false} is VALID [2018-11-23 10:02:43,336 INFO L273 TraceCheckUtils]: 34: Hoare triple {2441#false} assume !~bvslt32(~i~0, 100000bv32); {2441#false} is VALID [2018-11-23 10:02:43,337 INFO L273 TraceCheckUtils]: 33: Hoare triple {2441#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2441#false} is VALID [2018-11-23 10:02:43,337 INFO L273 TraceCheckUtils]: 32: Hoare triple {2441#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2441#false} is VALID [2018-11-23 10:02:43,337 INFO L273 TraceCheckUtils]: 31: Hoare triple {2441#false} ~i~0 := 0bv32; {2441#false} is VALID [2018-11-23 10:02:43,337 INFO L273 TraceCheckUtils]: 30: Hoare triple {2441#false} assume !~bvslt32(~i~0, 100000bv32); {2441#false} is VALID [2018-11-23 10:02:43,337 INFO L273 TraceCheckUtils]: 29: Hoare triple {2441#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2441#false} is VALID [2018-11-23 10:02:43,338 INFO L273 TraceCheckUtils]: 28: Hoare triple {2441#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2441#false} is VALID [2018-11-23 10:02:43,338 INFO L273 TraceCheckUtils]: 27: Hoare triple {2441#false} havoc ~i~0;~i~0 := 0bv32; {2441#false} is VALID [2018-11-23 10:02:43,343 INFO L273 TraceCheckUtils]: 26: Hoare triple {2762#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {2441#false} is VALID [2018-11-23 10:02:43,344 INFO L273 TraceCheckUtils]: 25: Hoare triple {2766#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2762#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:43,345 INFO L273 TraceCheckUtils]: 24: Hoare triple {2766#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2766#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,349 INFO L273 TraceCheckUtils]: 23: Hoare triple {2773#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2766#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,350 INFO L273 TraceCheckUtils]: 22: Hoare triple {2773#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2773#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,354 INFO L273 TraceCheckUtils]: 21: Hoare triple {2780#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2773#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,354 INFO L273 TraceCheckUtils]: 20: Hoare triple {2780#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2780#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,358 INFO L273 TraceCheckUtils]: 19: Hoare triple {2787#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2780#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,359 INFO L273 TraceCheckUtils]: 18: Hoare triple {2787#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2787#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,365 INFO L273 TraceCheckUtils]: 17: Hoare triple {2794#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2787#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,365 INFO L273 TraceCheckUtils]: 16: Hoare triple {2794#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2794#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,369 INFO L273 TraceCheckUtils]: 15: Hoare triple {2801#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2794#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,370 INFO L273 TraceCheckUtils]: 14: Hoare triple {2801#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2801#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,375 INFO L273 TraceCheckUtils]: 13: Hoare triple {2808#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2801#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {2808#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2808#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,381 INFO L273 TraceCheckUtils]: 11: Hoare triple {2815#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2808#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,383 INFO L273 TraceCheckUtils]: 10: Hoare triple {2815#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2815#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,388 INFO L273 TraceCheckUtils]: 9: Hoare triple {2822#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2815#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,395 INFO L273 TraceCheckUtils]: 8: Hoare triple {2822#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2822#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,405 INFO L273 TraceCheckUtils]: 7: Hoare triple {2829#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2822#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,405 INFO L273 TraceCheckUtils]: 6: Hoare triple {2829#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2829#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,407 INFO L273 TraceCheckUtils]: 5: Hoare triple {2440#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2829#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,407 INFO L256 TraceCheckUtils]: 4: Hoare triple {2440#true} call #t~ret21 := main(); {2440#true} is VALID [2018-11-23 10:02:43,407 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2440#true} {2440#true} #161#return; {2440#true} is VALID [2018-11-23 10:02:43,407 INFO L273 TraceCheckUtils]: 2: Hoare triple {2440#true} assume true; {2440#true} is VALID [2018-11-23 10:02:43,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {2440#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2440#true} is VALID [2018-11-23 10:02:43,408 INFO L256 TraceCheckUtils]: 0: Hoare triple {2440#true} call ULTIMATE.init(); {2440#true} is VALID [2018-11-23 10:02:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 10:02:43,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:43,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:02:43,414 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 65 [2018-11-23 10:02:43,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:43,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:02:43,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:43,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:02:43,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:02:43,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:02:43,750 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 24 states. [2018-11-23 10:02:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:48,066 INFO L93 Difference]: Finished difference Result 137 states and 166 transitions. [2018-11-23 10:02:48,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:02:48,066 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 65 [2018-11-23 10:02:48,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:48,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:02:48,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 150 transitions. [2018-11-23 10:02:48,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:02:48,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 150 transitions. [2018-11-23 10:02:48,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 150 transitions. [2018-11-23 10:02:48,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:48,377 INFO L225 Difference]: With dead ends: 137 [2018-11-23 10:02:48,377 INFO L226 Difference]: Without dead ends: 94 [2018-11-23 10:02:48,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:02:48,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-23 10:02:48,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-11-23 10:02:48,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:48,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 94 states. [2018-11-23 10:02:48,414 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 94 states. [2018-11-23 10:02:48,414 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 94 states. [2018-11-23 10:02:48,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:48,417 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-11-23 10:02:48,417 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-11-23 10:02:48,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:48,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:48,418 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 94 states. [2018-11-23 10:02:48,418 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 94 states. [2018-11-23 10:02:48,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:48,422 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-11-23 10:02:48,422 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-11-23 10:02:48,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:48,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:48,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:48,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:48,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 10:02:48,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2018-11-23 10:02:48,426 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 65 [2018-11-23 10:02:48,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:48,426 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2018-11-23 10:02:48,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:02:48,426 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-11-23 10:02:48,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 10:02:48,427 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:48,427 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:48,428 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:48,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:48,428 INFO L82 PathProgramCache]: Analyzing trace with hash 342516246, now seen corresponding path program 3 times [2018-11-23 10:02:48,428 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:48,429 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:48,445 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:02:48,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 10:02:48,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:48,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:48,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {3403#true} call ULTIMATE.init(); {3403#true} is VALID [2018-11-23 10:02:48,780 INFO L273 TraceCheckUtils]: 1: Hoare triple {3403#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3403#true} is VALID [2018-11-23 10:02:48,780 INFO L273 TraceCheckUtils]: 2: Hoare triple {3403#true} assume true; {3403#true} is VALID [2018-11-23 10:02:48,780 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3403#true} {3403#true} #161#return; {3403#true} is VALID [2018-11-23 10:02:48,780 INFO L256 TraceCheckUtils]: 4: Hoare triple {3403#true} call #t~ret21 := main(); {3403#true} is VALID [2018-11-23 10:02:48,781 INFO L273 TraceCheckUtils]: 5: Hoare triple {3403#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {3403#true} is VALID [2018-11-23 10:02:48,781 INFO L273 TraceCheckUtils]: 6: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,781 INFO L273 TraceCheckUtils]: 7: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,781 INFO L273 TraceCheckUtils]: 8: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,782 INFO L273 TraceCheckUtils]: 9: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,782 INFO L273 TraceCheckUtils]: 10: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,782 INFO L273 TraceCheckUtils]: 11: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,782 INFO L273 TraceCheckUtils]: 12: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,782 INFO L273 TraceCheckUtils]: 13: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,782 INFO L273 TraceCheckUtils]: 14: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,782 INFO L273 TraceCheckUtils]: 15: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,783 INFO L273 TraceCheckUtils]: 16: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,783 INFO L273 TraceCheckUtils]: 17: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,783 INFO L273 TraceCheckUtils]: 18: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,783 INFO L273 TraceCheckUtils]: 19: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,783 INFO L273 TraceCheckUtils]: 20: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,783 INFO L273 TraceCheckUtils]: 21: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,783 INFO L273 TraceCheckUtils]: 22: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,783 INFO L273 TraceCheckUtils]: 23: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,784 INFO L273 TraceCheckUtils]: 24: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,784 INFO L273 TraceCheckUtils]: 25: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,784 INFO L273 TraceCheckUtils]: 26: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,784 INFO L273 TraceCheckUtils]: 27: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,784 INFO L273 TraceCheckUtils]: 28: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,784 INFO L273 TraceCheckUtils]: 29: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,784 INFO L273 TraceCheckUtils]: 30: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,785 INFO L273 TraceCheckUtils]: 31: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,785 INFO L273 TraceCheckUtils]: 32: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,785 INFO L273 TraceCheckUtils]: 33: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,785 INFO L273 TraceCheckUtils]: 34: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,785 INFO L273 TraceCheckUtils]: 35: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,785 INFO L273 TraceCheckUtils]: 36: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,785 INFO L273 TraceCheckUtils]: 37: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,785 INFO L273 TraceCheckUtils]: 38: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,786 INFO L273 TraceCheckUtils]: 39: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,786 INFO L273 TraceCheckUtils]: 40: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,786 INFO L273 TraceCheckUtils]: 41: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,786 INFO L273 TraceCheckUtils]: 42: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,786 INFO L273 TraceCheckUtils]: 43: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,786 INFO L273 TraceCheckUtils]: 44: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,786 INFO L273 TraceCheckUtils]: 45: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,787 INFO L273 TraceCheckUtils]: 46: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,787 INFO L273 TraceCheckUtils]: 47: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,787 INFO L273 TraceCheckUtils]: 48: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,787 INFO L273 TraceCheckUtils]: 49: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,787 INFO L273 TraceCheckUtils]: 50: Hoare triple {3403#true} assume !~bvslt32(~a~0, 100000bv32); {3403#true} is VALID [2018-11-23 10:02:48,787 INFO L273 TraceCheckUtils]: 51: Hoare triple {3403#true} havoc ~i~0;~i~0 := 0bv32; {3403#true} is VALID [2018-11-23 10:02:48,788 INFO L273 TraceCheckUtils]: 52: Hoare triple {3403#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3403#true} is VALID [2018-11-23 10:02:48,788 INFO L273 TraceCheckUtils]: 53: Hoare triple {3403#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3403#true} is VALID [2018-11-23 10:02:48,788 INFO L273 TraceCheckUtils]: 54: Hoare triple {3403#true} assume !~bvslt32(~i~0, 100000bv32); {3403#true} is VALID [2018-11-23 10:02:48,788 INFO L273 TraceCheckUtils]: 55: Hoare triple {3403#true} ~i~0 := 0bv32; {3403#true} is VALID [2018-11-23 10:02:48,788 INFO L273 TraceCheckUtils]: 56: Hoare triple {3403#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {3403#true} is VALID [2018-11-23 10:02:48,788 INFO L273 TraceCheckUtils]: 57: Hoare triple {3403#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3403#true} is VALID [2018-11-23 10:02:48,788 INFO L273 TraceCheckUtils]: 58: Hoare triple {3403#true} assume !~bvslt32(~i~0, 100000bv32); {3403#true} is VALID [2018-11-23 10:02:48,789 INFO L273 TraceCheckUtils]: 59: Hoare triple {3403#true} ~i~0 := 0bv32; {3403#true} is VALID [2018-11-23 10:02:48,789 INFO L273 TraceCheckUtils]: 60: Hoare triple {3403#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {3403#true} is VALID [2018-11-23 10:02:48,789 INFO L273 TraceCheckUtils]: 61: Hoare triple {3403#true} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3403#true} is VALID [2018-11-23 10:02:48,789 INFO L273 TraceCheckUtils]: 62: Hoare triple {3403#true} assume !~bvslt32(~i~0, 100000bv32); {3403#true} is VALID [2018-11-23 10:02:48,789 INFO L273 TraceCheckUtils]: 63: Hoare triple {3403#true} ~i~0 := 0bv32; {3597#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:48,790 INFO L273 TraceCheckUtils]: 64: Hoare triple {3597#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3597#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:48,790 INFO L273 TraceCheckUtils]: 65: Hoare triple {3597#(= main_~i~0 (_ bv0 32))} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3604#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:48,790 INFO L273 TraceCheckUtils]: 66: Hoare triple {3604#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {3404#false} is VALID [2018-11-23 10:02:48,791 INFO L273 TraceCheckUtils]: 67: Hoare triple {3404#false} ~i~0 := 0bv32; {3404#false} is VALID [2018-11-23 10:02:48,791 INFO L273 TraceCheckUtils]: 68: Hoare triple {3404#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {3404#false} is VALID [2018-11-23 10:02:48,791 INFO L273 TraceCheckUtils]: 69: Hoare triple {3404#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {3404#false} is VALID [2018-11-23 10:02:48,791 INFO L273 TraceCheckUtils]: 70: Hoare triple {3404#false} assume !~bvslt32(~i~0, 100000bv32); {3404#false} is VALID [2018-11-23 10:02:48,791 INFO L273 TraceCheckUtils]: 71: Hoare triple {3404#false} ~i~0 := 0bv32; {3404#false} is VALID [2018-11-23 10:02:48,792 INFO L273 TraceCheckUtils]: 72: Hoare triple {3404#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {3404#false} is VALID [2018-11-23 10:02:48,792 INFO L273 TraceCheckUtils]: 73: Hoare triple {3404#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {3404#false} is VALID [2018-11-23 10:02:48,792 INFO L273 TraceCheckUtils]: 74: Hoare triple {3404#false} assume !~bvslt32(~i~0, 100000bv32); {3404#false} is VALID [2018-11-23 10:02:48,792 INFO L273 TraceCheckUtils]: 75: Hoare triple {3404#false} ~i~0 := 0bv32; {3404#false} is VALID [2018-11-23 10:02:48,792 INFO L273 TraceCheckUtils]: 76: Hoare triple {3404#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {3404#false} is VALID [2018-11-23 10:02:48,793 INFO L273 TraceCheckUtils]: 77: Hoare triple {3404#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {3404#false} is VALID [2018-11-23 10:02:48,793 INFO L273 TraceCheckUtils]: 78: Hoare triple {3404#false} assume !~bvslt32(~i~0, 100000bv32); {3404#false} is VALID [2018-11-23 10:02:48,793 INFO L273 TraceCheckUtils]: 79: Hoare triple {3404#false} ~i~0 := 0bv32; {3404#false} is VALID [2018-11-23 10:02:48,794 INFO L273 TraceCheckUtils]: 80: Hoare triple {3404#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem17, ~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem17; {3404#false} is VALID [2018-11-23 10:02:48,794 INFO L273 TraceCheckUtils]: 81: Hoare triple {3404#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {3404#false} is VALID [2018-11-23 10:02:48,794 INFO L273 TraceCheckUtils]: 82: Hoare triple {3404#false} assume !~bvslt32(~i~0, 100000bv32); {3404#false} is VALID [2018-11-23 10:02:48,794 INFO L273 TraceCheckUtils]: 83: Hoare triple {3404#false} havoc ~x~0;~x~0 := 0bv32; {3404#false} is VALID [2018-11-23 10:02:48,794 INFO L273 TraceCheckUtils]: 84: Hoare triple {3404#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem19 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem20 := read~intINTTYPE4(~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3404#false} is VALID [2018-11-23 10:02:48,795 INFO L256 TraceCheckUtils]: 85: Hoare triple {3404#false} call __VERIFIER_assert((if #t~mem19 == #t~mem20 then 1bv32 else 0bv32)); {3404#false} is VALID [2018-11-23 10:02:48,795 INFO L273 TraceCheckUtils]: 86: Hoare triple {3404#false} ~cond := #in~cond; {3404#false} is VALID [2018-11-23 10:02:48,795 INFO L273 TraceCheckUtils]: 87: Hoare triple {3404#false} assume 0bv32 == ~cond; {3404#false} is VALID [2018-11-23 10:02:48,795 INFO L273 TraceCheckUtils]: 88: Hoare triple {3404#false} assume !false; {3404#false} is VALID [2018-11-23 10:02:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2018-11-23 10:02:48,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:48,957 INFO L273 TraceCheckUtils]: 88: Hoare triple {3404#false} assume !false; {3404#false} is VALID [2018-11-23 10:02:48,958 INFO L273 TraceCheckUtils]: 87: Hoare triple {3404#false} assume 0bv32 == ~cond; {3404#false} is VALID [2018-11-23 10:02:48,958 INFO L273 TraceCheckUtils]: 86: Hoare triple {3404#false} ~cond := #in~cond; {3404#false} is VALID [2018-11-23 10:02:48,958 INFO L256 TraceCheckUtils]: 85: Hoare triple {3404#false} call __VERIFIER_assert((if #t~mem19 == #t~mem20 then 1bv32 else 0bv32)); {3404#false} is VALID [2018-11-23 10:02:48,959 INFO L273 TraceCheckUtils]: 84: Hoare triple {3404#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem19 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem20 := read~intINTTYPE4(~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3404#false} is VALID [2018-11-23 10:02:48,959 INFO L273 TraceCheckUtils]: 83: Hoare triple {3404#false} havoc ~x~0;~x~0 := 0bv32; {3404#false} is VALID [2018-11-23 10:02:48,959 INFO L273 TraceCheckUtils]: 82: Hoare triple {3404#false} assume !~bvslt32(~i~0, 100000bv32); {3404#false} is VALID [2018-11-23 10:02:48,959 INFO L273 TraceCheckUtils]: 81: Hoare triple {3404#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {3404#false} is VALID [2018-11-23 10:02:48,960 INFO L273 TraceCheckUtils]: 80: Hoare triple {3404#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem17, ~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem17; {3404#false} is VALID [2018-11-23 10:02:48,960 INFO L273 TraceCheckUtils]: 79: Hoare triple {3404#false} ~i~0 := 0bv32; {3404#false} is VALID [2018-11-23 10:02:48,960 INFO L273 TraceCheckUtils]: 78: Hoare triple {3404#false} assume !~bvslt32(~i~0, 100000bv32); {3404#false} is VALID [2018-11-23 10:02:48,960 INFO L273 TraceCheckUtils]: 77: Hoare triple {3404#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {3404#false} is VALID [2018-11-23 10:02:48,960 INFO L273 TraceCheckUtils]: 76: Hoare triple {3404#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {3404#false} is VALID [2018-11-23 10:02:48,961 INFO L273 TraceCheckUtils]: 75: Hoare triple {3404#false} ~i~0 := 0bv32; {3404#false} is VALID [2018-11-23 10:02:48,961 INFO L273 TraceCheckUtils]: 74: Hoare triple {3404#false} assume !~bvslt32(~i~0, 100000bv32); {3404#false} is VALID [2018-11-23 10:02:48,961 INFO L273 TraceCheckUtils]: 73: Hoare triple {3404#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {3404#false} is VALID [2018-11-23 10:02:48,961 INFO L273 TraceCheckUtils]: 72: Hoare triple {3404#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {3404#false} is VALID [2018-11-23 10:02:48,961 INFO L273 TraceCheckUtils]: 71: Hoare triple {3404#false} ~i~0 := 0bv32; {3404#false} is VALID [2018-11-23 10:02:48,961 INFO L273 TraceCheckUtils]: 70: Hoare triple {3404#false} assume !~bvslt32(~i~0, 100000bv32); {3404#false} is VALID [2018-11-23 10:02:48,961 INFO L273 TraceCheckUtils]: 69: Hoare triple {3404#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {3404#false} is VALID [2018-11-23 10:02:48,962 INFO L273 TraceCheckUtils]: 68: Hoare triple {3404#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {3404#false} is VALID [2018-11-23 10:02:48,962 INFO L273 TraceCheckUtils]: 67: Hoare triple {3404#false} ~i~0 := 0bv32; {3404#false} is VALID [2018-11-23 10:02:48,962 INFO L273 TraceCheckUtils]: 66: Hoare triple {3740#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {3404#false} is VALID [2018-11-23 10:02:48,963 INFO L273 TraceCheckUtils]: 65: Hoare triple {3744#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3740#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:48,963 INFO L273 TraceCheckUtils]: 64: Hoare triple {3744#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3744#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:48,963 INFO L273 TraceCheckUtils]: 63: Hoare triple {3403#true} ~i~0 := 0bv32; {3744#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:48,964 INFO L273 TraceCheckUtils]: 62: Hoare triple {3403#true} assume !~bvslt32(~i~0, 100000bv32); {3403#true} is VALID [2018-11-23 10:02:48,964 INFO L273 TraceCheckUtils]: 61: Hoare triple {3403#true} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3403#true} is VALID [2018-11-23 10:02:48,964 INFO L273 TraceCheckUtils]: 60: Hoare triple {3403#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {3403#true} is VALID [2018-11-23 10:02:48,964 INFO L273 TraceCheckUtils]: 59: Hoare triple {3403#true} ~i~0 := 0bv32; {3403#true} is VALID [2018-11-23 10:02:48,964 INFO L273 TraceCheckUtils]: 58: Hoare triple {3403#true} assume !~bvslt32(~i~0, 100000bv32); {3403#true} is VALID [2018-11-23 10:02:48,964 INFO L273 TraceCheckUtils]: 57: Hoare triple {3403#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3403#true} is VALID [2018-11-23 10:02:48,964 INFO L273 TraceCheckUtils]: 56: Hoare triple {3403#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {3403#true} is VALID [2018-11-23 10:02:48,965 INFO L273 TraceCheckUtils]: 55: Hoare triple {3403#true} ~i~0 := 0bv32; {3403#true} is VALID [2018-11-23 10:02:48,965 INFO L273 TraceCheckUtils]: 54: Hoare triple {3403#true} assume !~bvslt32(~i~0, 100000bv32); {3403#true} is VALID [2018-11-23 10:02:48,965 INFO L273 TraceCheckUtils]: 53: Hoare triple {3403#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3403#true} is VALID [2018-11-23 10:02:48,965 INFO L273 TraceCheckUtils]: 52: Hoare triple {3403#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3403#true} is VALID [2018-11-23 10:02:48,965 INFO L273 TraceCheckUtils]: 51: Hoare triple {3403#true} havoc ~i~0;~i~0 := 0bv32; {3403#true} is VALID [2018-11-23 10:02:48,966 INFO L273 TraceCheckUtils]: 50: Hoare triple {3403#true} assume !~bvslt32(~a~0, 100000bv32); {3403#true} is VALID [2018-11-23 10:02:48,966 INFO L273 TraceCheckUtils]: 49: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,966 INFO L273 TraceCheckUtils]: 48: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,966 INFO L273 TraceCheckUtils]: 47: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,966 INFO L273 TraceCheckUtils]: 46: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,967 INFO L273 TraceCheckUtils]: 45: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,967 INFO L273 TraceCheckUtils]: 44: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,967 INFO L273 TraceCheckUtils]: 43: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,967 INFO L273 TraceCheckUtils]: 42: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,968 INFO L273 TraceCheckUtils]: 41: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,968 INFO L273 TraceCheckUtils]: 40: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,968 INFO L273 TraceCheckUtils]: 39: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,969 INFO L273 TraceCheckUtils]: 38: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,969 INFO L273 TraceCheckUtils]: 37: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,969 INFO L273 TraceCheckUtils]: 36: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,969 INFO L273 TraceCheckUtils]: 35: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,969 INFO L273 TraceCheckUtils]: 34: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,970 INFO L273 TraceCheckUtils]: 33: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,970 INFO L273 TraceCheckUtils]: 32: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,970 INFO L273 TraceCheckUtils]: 31: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,970 INFO L273 TraceCheckUtils]: 30: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,970 INFO L273 TraceCheckUtils]: 29: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,970 INFO L273 TraceCheckUtils]: 28: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,971 INFO L273 TraceCheckUtils]: 27: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,971 INFO L273 TraceCheckUtils]: 26: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,971 INFO L273 TraceCheckUtils]: 25: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,971 INFO L273 TraceCheckUtils]: 24: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,971 INFO L273 TraceCheckUtils]: 23: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,972 INFO L273 TraceCheckUtils]: 22: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,972 INFO L273 TraceCheckUtils]: 21: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,972 INFO L273 TraceCheckUtils]: 20: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,972 INFO L273 TraceCheckUtils]: 19: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,972 INFO L273 TraceCheckUtils]: 18: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,972 INFO L273 TraceCheckUtils]: 17: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,973 INFO L273 TraceCheckUtils]: 16: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,973 INFO L273 TraceCheckUtils]: 15: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,973 INFO L273 TraceCheckUtils]: 13: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,973 INFO L273 TraceCheckUtils]: 12: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,974 INFO L273 TraceCheckUtils]: 11: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,974 INFO L273 TraceCheckUtils]: 10: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,974 INFO L273 TraceCheckUtils]: 8: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,974 INFO L273 TraceCheckUtils]: 7: Hoare triple {3403#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3403#true} is VALID [2018-11-23 10:02:48,974 INFO L273 TraceCheckUtils]: 6: Hoare triple {3403#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3403#true} is VALID [2018-11-23 10:02:48,975 INFO L273 TraceCheckUtils]: 5: Hoare triple {3403#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {3403#true} is VALID [2018-11-23 10:02:48,975 INFO L256 TraceCheckUtils]: 4: Hoare triple {3403#true} call #t~ret21 := main(); {3403#true} is VALID [2018-11-23 10:02:48,975 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3403#true} {3403#true} #161#return; {3403#true} is VALID [2018-11-23 10:02:48,975 INFO L273 TraceCheckUtils]: 2: Hoare triple {3403#true} assume true; {3403#true} is VALID [2018-11-23 10:02:48,975 INFO L273 TraceCheckUtils]: 1: Hoare triple {3403#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3403#true} is VALID [2018-11-23 10:02:48,976 INFO L256 TraceCheckUtils]: 0: Hoare triple {3403#true} call ULTIMATE.init(); {3403#true} is VALID [2018-11-23 10:02:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2018-11-23 10:02:48,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:48,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:02:48,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-11-23 10:02:48,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:48,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:02:49,082 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:49,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:02:49,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:02:49,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:02:49,084 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 6 states. [2018-11-23 10:02:50,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:50,077 INFO L93 Difference]: Finished difference Result 181 states and 221 transitions. [2018-11-23 10:02:50,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:02:50,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-11-23 10:02:50,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:50,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:50,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2018-11-23 10:02:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:50,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2018-11-23 10:02:50,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 171 transitions. [2018-11-23 10:02:50,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:50,386 INFO L225 Difference]: With dead ends: 181 [2018-11-23 10:02:50,386 INFO L226 Difference]: Without dead ends: 142 [2018-11-23 10:02:50,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:02:50,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-23 10:02:50,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-11-23 10:02:50,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:50,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 142 states. [2018-11-23 10:02:50,463 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 142 states. [2018-11-23 10:02:50,463 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 142 states. [2018-11-23 10:02:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:50,468 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2018-11-23 10:02:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-11-23 10:02:50,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:50,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:50,469 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 142 states. [2018-11-23 10:02:50,469 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 142 states. [2018-11-23 10:02:50,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:50,474 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2018-11-23 10:02:50,474 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-11-23 10:02:50,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:50,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:50,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:50,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-23 10:02:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2018-11-23 10:02:50,480 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 89 [2018-11-23 10:02:50,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:50,480 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2018-11-23 10:02:50,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:02:50,480 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-11-23 10:02:50,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-23 10:02:50,482 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:50,482 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:50,482 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:50,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:50,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1498754074, now seen corresponding path program 4 times [2018-11-23 10:02:50,483 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:50,484 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:50,507 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:02:50,702 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:02:50,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:50,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:51,569 INFO L256 TraceCheckUtils]: 0: Hoare triple {4709#true} call ULTIMATE.init(); {4709#true} is VALID [2018-11-23 10:02:51,569 INFO L273 TraceCheckUtils]: 1: Hoare triple {4709#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4709#true} is VALID [2018-11-23 10:02:51,570 INFO L273 TraceCheckUtils]: 2: Hoare triple {4709#true} assume true; {4709#true} is VALID [2018-11-23 10:02:51,570 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4709#true} {4709#true} #161#return; {4709#true} is VALID [2018-11-23 10:02:51,570 INFO L256 TraceCheckUtils]: 4: Hoare triple {4709#true} call #t~ret21 := main(); {4709#true} is VALID [2018-11-23 10:02:51,571 INFO L273 TraceCheckUtils]: 5: Hoare triple {4709#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {4729#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:51,571 INFO L273 TraceCheckUtils]: 6: Hoare triple {4729#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4729#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:51,572 INFO L273 TraceCheckUtils]: 7: Hoare triple {4729#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4736#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:51,572 INFO L273 TraceCheckUtils]: 8: Hoare triple {4736#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4736#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:51,573 INFO L273 TraceCheckUtils]: 9: Hoare triple {4736#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4743#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:51,573 INFO L273 TraceCheckUtils]: 10: Hoare triple {4743#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4743#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:51,573 INFO L273 TraceCheckUtils]: 11: Hoare triple {4743#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4750#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:51,574 INFO L273 TraceCheckUtils]: 12: Hoare triple {4750#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4750#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:51,574 INFO L273 TraceCheckUtils]: 13: Hoare triple {4750#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4757#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:51,575 INFO L273 TraceCheckUtils]: 14: Hoare triple {4757#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4757#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:51,575 INFO L273 TraceCheckUtils]: 15: Hoare triple {4757#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4764#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:51,576 INFO L273 TraceCheckUtils]: 16: Hoare triple {4764#(= (_ bv5 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4764#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:51,577 INFO L273 TraceCheckUtils]: 17: Hoare triple {4764#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4771#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:51,577 INFO L273 TraceCheckUtils]: 18: Hoare triple {4771#(= (_ bv6 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4771#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:51,578 INFO L273 TraceCheckUtils]: 19: Hoare triple {4771#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4778#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:51,579 INFO L273 TraceCheckUtils]: 20: Hoare triple {4778#(= (_ bv7 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4778#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:51,580 INFO L273 TraceCheckUtils]: 21: Hoare triple {4778#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4785#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:51,580 INFO L273 TraceCheckUtils]: 22: Hoare triple {4785#(= (_ bv8 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4785#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:51,581 INFO L273 TraceCheckUtils]: 23: Hoare triple {4785#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4792#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:51,582 INFO L273 TraceCheckUtils]: 24: Hoare triple {4792#(= (_ bv9 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4792#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:51,582 INFO L273 TraceCheckUtils]: 25: Hoare triple {4792#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4799#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 10:02:51,583 INFO L273 TraceCheckUtils]: 26: Hoare triple {4799#(= (_ bv10 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4799#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 10:02:51,584 INFO L273 TraceCheckUtils]: 27: Hoare triple {4799#(= (_ bv10 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4806#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-23 10:02:51,584 INFO L273 TraceCheckUtils]: 28: Hoare triple {4806#(= (_ bv11 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4806#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-23 10:02:51,585 INFO L273 TraceCheckUtils]: 29: Hoare triple {4806#(= (_ bv11 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4813#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-23 10:02:51,586 INFO L273 TraceCheckUtils]: 30: Hoare triple {4813#(= (_ bv12 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4813#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-23 10:02:51,587 INFO L273 TraceCheckUtils]: 31: Hoare triple {4813#(= (_ bv12 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4820#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-23 10:02:51,588 INFO L273 TraceCheckUtils]: 32: Hoare triple {4820#(= (_ bv13 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4820#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-23 10:02:51,588 INFO L273 TraceCheckUtils]: 33: Hoare triple {4820#(= (_ bv13 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4827#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-23 10:02:51,589 INFO L273 TraceCheckUtils]: 34: Hoare triple {4827#(= (_ bv14 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4827#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-23 10:02:51,590 INFO L273 TraceCheckUtils]: 35: Hoare triple {4827#(= (_ bv14 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4834#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-23 10:02:51,590 INFO L273 TraceCheckUtils]: 36: Hoare triple {4834#(= (_ bv15 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4834#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-23 10:02:51,591 INFO L273 TraceCheckUtils]: 37: Hoare triple {4834#(= (_ bv15 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4841#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-23 10:02:51,592 INFO L273 TraceCheckUtils]: 38: Hoare triple {4841#(= (_ bv16 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4841#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-23 10:02:51,593 INFO L273 TraceCheckUtils]: 39: Hoare triple {4841#(= (_ bv16 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4848#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-23 10:02:51,593 INFO L273 TraceCheckUtils]: 40: Hoare triple {4848#(= (_ bv17 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4848#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-23 10:02:51,594 INFO L273 TraceCheckUtils]: 41: Hoare triple {4848#(= (_ bv17 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4855#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-23 10:02:51,595 INFO L273 TraceCheckUtils]: 42: Hoare triple {4855#(= (_ bv18 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4855#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-23 10:02:51,595 INFO L273 TraceCheckUtils]: 43: Hoare triple {4855#(= (_ bv18 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4862#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-23 10:02:51,596 INFO L273 TraceCheckUtils]: 44: Hoare triple {4862#(= (_ bv19 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4862#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-23 10:02:51,597 INFO L273 TraceCheckUtils]: 45: Hoare triple {4862#(= (_ bv19 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4869#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-23 10:02:51,597 INFO L273 TraceCheckUtils]: 46: Hoare triple {4869#(= (_ bv20 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4869#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-23 10:02:51,599 INFO L273 TraceCheckUtils]: 47: Hoare triple {4869#(= (_ bv20 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4876#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-23 10:02:51,600 INFO L273 TraceCheckUtils]: 48: Hoare triple {4876#(= (_ bv21 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4876#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-23 10:02:51,600 INFO L273 TraceCheckUtils]: 49: Hoare triple {4876#(= (_ bv21 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4883#(= (_ bv22 32) main_~a~0)} is VALID [2018-11-23 10:02:51,601 INFO L273 TraceCheckUtils]: 50: Hoare triple {4883#(= (_ bv22 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {4710#false} is VALID [2018-11-23 10:02:51,601 INFO L273 TraceCheckUtils]: 51: Hoare triple {4710#false} havoc ~i~0;~i~0 := 0bv32; {4710#false} is VALID [2018-11-23 10:02:51,601 INFO L273 TraceCheckUtils]: 52: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4710#false} is VALID [2018-11-23 10:02:51,601 INFO L273 TraceCheckUtils]: 53: Hoare triple {4710#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4710#false} is VALID [2018-11-23 10:02:51,601 INFO L273 TraceCheckUtils]: 54: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4710#false} is VALID [2018-11-23 10:02:51,601 INFO L273 TraceCheckUtils]: 55: Hoare triple {4710#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4710#false} is VALID [2018-11-23 10:02:51,602 INFO L273 TraceCheckUtils]: 56: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4710#false} is VALID [2018-11-23 10:02:51,602 INFO L273 TraceCheckUtils]: 57: Hoare triple {4710#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4710#false} is VALID [2018-11-23 10:02:51,602 INFO L273 TraceCheckUtils]: 58: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4710#false} is VALID [2018-11-23 10:02:51,602 INFO L273 TraceCheckUtils]: 59: Hoare triple {4710#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4710#false} is VALID [2018-11-23 10:02:51,602 INFO L273 TraceCheckUtils]: 60: Hoare triple {4710#false} assume !~bvslt32(~i~0, 100000bv32); {4710#false} is VALID [2018-11-23 10:02:51,602 INFO L273 TraceCheckUtils]: 61: Hoare triple {4710#false} ~i~0 := 0bv32; {4710#false} is VALID [2018-11-23 10:02:51,603 INFO L273 TraceCheckUtils]: 62: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4710#false} is VALID [2018-11-23 10:02:51,603 INFO L273 TraceCheckUtils]: 63: Hoare triple {4710#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4710#false} is VALID [2018-11-23 10:02:51,603 INFO L273 TraceCheckUtils]: 64: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4710#false} is VALID [2018-11-23 10:02:51,603 INFO L273 TraceCheckUtils]: 65: Hoare triple {4710#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4710#false} is VALID [2018-11-23 10:02:51,603 INFO L273 TraceCheckUtils]: 66: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4710#false} is VALID [2018-11-23 10:02:51,603 INFO L273 TraceCheckUtils]: 67: Hoare triple {4710#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4710#false} is VALID [2018-11-23 10:02:51,603 INFO L273 TraceCheckUtils]: 68: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4710#false} is VALID [2018-11-23 10:02:51,604 INFO L273 TraceCheckUtils]: 69: Hoare triple {4710#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4710#false} is VALID [2018-11-23 10:02:51,604 INFO L273 TraceCheckUtils]: 70: Hoare triple {4710#false} assume !~bvslt32(~i~0, 100000bv32); {4710#false} is VALID [2018-11-23 10:02:51,604 INFO L273 TraceCheckUtils]: 71: Hoare triple {4710#false} ~i~0 := 0bv32; {4710#false} is VALID [2018-11-23 10:02:51,604 INFO L273 TraceCheckUtils]: 72: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4710#false} is VALID [2018-11-23 10:02:51,604 INFO L273 TraceCheckUtils]: 73: Hoare triple {4710#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4710#false} is VALID [2018-11-23 10:02:51,604 INFO L273 TraceCheckUtils]: 74: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4710#false} is VALID [2018-11-23 10:02:51,605 INFO L273 TraceCheckUtils]: 75: Hoare triple {4710#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4710#false} is VALID [2018-11-23 10:02:51,605 INFO L273 TraceCheckUtils]: 76: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4710#false} is VALID [2018-11-23 10:02:51,605 INFO L273 TraceCheckUtils]: 77: Hoare triple {4710#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4710#false} is VALID [2018-11-23 10:02:51,605 INFO L273 TraceCheckUtils]: 78: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4710#false} is VALID [2018-11-23 10:02:51,605 INFO L273 TraceCheckUtils]: 79: Hoare triple {4710#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4710#false} is VALID [2018-11-23 10:02:51,605 INFO L273 TraceCheckUtils]: 80: Hoare triple {4710#false} assume !~bvslt32(~i~0, 100000bv32); {4710#false} is VALID [2018-11-23 10:02:51,606 INFO L273 TraceCheckUtils]: 81: Hoare triple {4710#false} ~i~0 := 0bv32; {4710#false} is VALID [2018-11-23 10:02:51,606 INFO L273 TraceCheckUtils]: 82: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4710#false} is VALID [2018-11-23 10:02:51,606 INFO L273 TraceCheckUtils]: 83: Hoare triple {4710#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4710#false} is VALID [2018-11-23 10:02:51,606 INFO L273 TraceCheckUtils]: 84: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4710#false} is VALID [2018-11-23 10:02:51,606 INFO L273 TraceCheckUtils]: 85: Hoare triple {4710#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4710#false} is VALID [2018-11-23 10:02:51,606 INFO L273 TraceCheckUtils]: 86: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4710#false} is VALID [2018-11-23 10:02:51,606 INFO L273 TraceCheckUtils]: 87: Hoare triple {4710#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4710#false} is VALID [2018-11-23 10:02:51,607 INFO L273 TraceCheckUtils]: 88: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4710#false} is VALID [2018-11-23 10:02:51,607 INFO L273 TraceCheckUtils]: 89: Hoare triple {4710#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4710#false} is VALID [2018-11-23 10:02:51,607 INFO L273 TraceCheckUtils]: 90: Hoare triple {4710#false} assume !~bvslt32(~i~0, 100000bv32); {4710#false} is VALID [2018-11-23 10:02:51,607 INFO L273 TraceCheckUtils]: 91: Hoare triple {4710#false} ~i~0 := 0bv32; {4710#false} is VALID [2018-11-23 10:02:51,607 INFO L273 TraceCheckUtils]: 92: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4710#false} is VALID [2018-11-23 10:02:51,607 INFO L273 TraceCheckUtils]: 93: Hoare triple {4710#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4710#false} is VALID [2018-11-23 10:02:51,608 INFO L273 TraceCheckUtils]: 94: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4710#false} is VALID [2018-11-23 10:02:51,608 INFO L273 TraceCheckUtils]: 95: Hoare triple {4710#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4710#false} is VALID [2018-11-23 10:02:51,608 INFO L273 TraceCheckUtils]: 96: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4710#false} is VALID [2018-11-23 10:02:51,608 INFO L273 TraceCheckUtils]: 97: Hoare triple {4710#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4710#false} is VALID [2018-11-23 10:02:51,608 INFO L273 TraceCheckUtils]: 98: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4710#false} is VALID [2018-11-23 10:02:51,609 INFO L273 TraceCheckUtils]: 99: Hoare triple {4710#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4710#false} is VALID [2018-11-23 10:02:51,609 INFO L273 TraceCheckUtils]: 100: Hoare triple {4710#false} assume !~bvslt32(~i~0, 100000bv32); {4710#false} is VALID [2018-11-23 10:02:51,609 INFO L273 TraceCheckUtils]: 101: Hoare triple {4710#false} ~i~0 := 0bv32; {4710#false} is VALID [2018-11-23 10:02:51,609 INFO L273 TraceCheckUtils]: 102: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4710#false} is VALID [2018-11-23 10:02:51,610 INFO L273 TraceCheckUtils]: 103: Hoare triple {4710#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4710#false} is VALID [2018-11-23 10:02:51,610 INFO L273 TraceCheckUtils]: 104: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4710#false} is VALID [2018-11-23 10:02:51,610 INFO L273 TraceCheckUtils]: 105: Hoare triple {4710#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4710#false} is VALID [2018-11-23 10:02:51,610 INFO L273 TraceCheckUtils]: 106: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4710#false} is VALID [2018-11-23 10:02:51,610 INFO L273 TraceCheckUtils]: 107: Hoare triple {4710#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4710#false} is VALID [2018-11-23 10:02:51,611 INFO L273 TraceCheckUtils]: 108: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4710#false} is VALID [2018-11-23 10:02:51,611 INFO L273 TraceCheckUtils]: 109: Hoare triple {4710#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4710#false} is VALID [2018-11-23 10:02:51,611 INFO L273 TraceCheckUtils]: 110: Hoare triple {4710#false} assume !~bvslt32(~i~0, 100000bv32); {4710#false} is VALID [2018-11-23 10:02:51,611 INFO L273 TraceCheckUtils]: 111: Hoare triple {4710#false} ~i~0 := 0bv32; {4710#false} is VALID [2018-11-23 10:02:51,611 INFO L273 TraceCheckUtils]: 112: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {4710#false} is VALID [2018-11-23 10:02:51,612 INFO L273 TraceCheckUtils]: 113: Hoare triple {4710#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {4710#false} is VALID [2018-11-23 10:02:51,612 INFO L273 TraceCheckUtils]: 114: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {4710#false} is VALID [2018-11-23 10:02:51,612 INFO L273 TraceCheckUtils]: 115: Hoare triple {4710#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {4710#false} is VALID [2018-11-23 10:02:51,612 INFO L273 TraceCheckUtils]: 116: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {4710#false} is VALID [2018-11-23 10:02:51,612 INFO L273 TraceCheckUtils]: 117: Hoare triple {4710#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {4710#false} is VALID [2018-11-23 10:02:51,613 INFO L273 TraceCheckUtils]: 118: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {4710#false} is VALID [2018-11-23 10:02:51,613 INFO L273 TraceCheckUtils]: 119: Hoare triple {4710#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {4710#false} is VALID [2018-11-23 10:02:51,613 INFO L273 TraceCheckUtils]: 120: Hoare triple {4710#false} assume !~bvslt32(~i~0, 100000bv32); {4710#false} is VALID [2018-11-23 10:02:51,613 INFO L273 TraceCheckUtils]: 121: Hoare triple {4710#false} ~i~0 := 0bv32; {4710#false} is VALID [2018-11-23 10:02:51,614 INFO L273 TraceCheckUtils]: 122: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem17, ~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem17; {4710#false} is VALID [2018-11-23 10:02:51,614 INFO L273 TraceCheckUtils]: 123: Hoare triple {4710#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {4710#false} is VALID [2018-11-23 10:02:51,614 INFO L273 TraceCheckUtils]: 124: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem17, ~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem17; {4710#false} is VALID [2018-11-23 10:02:51,614 INFO L273 TraceCheckUtils]: 125: Hoare triple {4710#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {4710#false} is VALID [2018-11-23 10:02:51,614 INFO L273 TraceCheckUtils]: 126: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem17, ~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem17; {4710#false} is VALID [2018-11-23 10:02:51,615 INFO L273 TraceCheckUtils]: 127: Hoare triple {4710#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {4710#false} is VALID [2018-11-23 10:02:51,615 INFO L273 TraceCheckUtils]: 128: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem17, ~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem17; {4710#false} is VALID [2018-11-23 10:02:51,615 INFO L273 TraceCheckUtils]: 129: Hoare triple {4710#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {4710#false} is VALID [2018-11-23 10:02:51,615 INFO L273 TraceCheckUtils]: 130: Hoare triple {4710#false} assume !~bvslt32(~i~0, 100000bv32); {4710#false} is VALID [2018-11-23 10:02:51,615 INFO L273 TraceCheckUtils]: 131: Hoare triple {4710#false} havoc ~x~0;~x~0 := 0bv32; {4710#false} is VALID [2018-11-23 10:02:51,616 INFO L273 TraceCheckUtils]: 132: Hoare triple {4710#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem19 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem20 := read~intINTTYPE4(~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {4710#false} is VALID [2018-11-23 10:02:51,616 INFO L256 TraceCheckUtils]: 133: Hoare triple {4710#false} call __VERIFIER_assert((if #t~mem19 == #t~mem20 then 1bv32 else 0bv32)); {4710#false} is VALID [2018-11-23 10:02:51,616 INFO L273 TraceCheckUtils]: 134: Hoare triple {4710#false} ~cond := #in~cond; {4710#false} is VALID [2018-11-23 10:02:51,616 INFO L273 TraceCheckUtils]: 135: Hoare triple {4710#false} assume 0bv32 == ~cond; {4710#false} is VALID [2018-11-23 10:02:51,617 INFO L273 TraceCheckUtils]: 136: Hoare triple {4710#false} assume !false; {4710#false} is VALID [2018-11-23 10:02:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-23 10:02:51,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:53,934 INFO L273 TraceCheckUtils]: 136: Hoare triple {4710#false} assume !false; {4710#false} is VALID [2018-11-23 10:02:53,934 INFO L273 TraceCheckUtils]: 135: Hoare triple {4710#false} assume 0bv32 == ~cond; {4710#false} is VALID [2018-11-23 10:02:53,934 INFO L273 TraceCheckUtils]: 134: Hoare triple {4710#false} ~cond := #in~cond; {4710#false} is VALID [2018-11-23 10:02:53,935 INFO L256 TraceCheckUtils]: 133: Hoare triple {4710#false} call __VERIFIER_assert((if #t~mem19 == #t~mem20 then 1bv32 else 0bv32)); {4710#false} is VALID [2018-11-23 10:02:53,935 INFO L273 TraceCheckUtils]: 132: Hoare triple {4710#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem19 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem20 := read~intINTTYPE4(~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {4710#false} is VALID [2018-11-23 10:02:53,935 INFO L273 TraceCheckUtils]: 131: Hoare triple {4710#false} havoc ~x~0;~x~0 := 0bv32; {4710#false} is VALID [2018-11-23 10:02:53,935 INFO L273 TraceCheckUtils]: 130: Hoare triple {4710#false} assume !~bvslt32(~i~0, 100000bv32); {4710#false} is VALID [2018-11-23 10:02:53,935 INFO L273 TraceCheckUtils]: 129: Hoare triple {4710#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {4710#false} is VALID [2018-11-23 10:02:53,935 INFO L273 TraceCheckUtils]: 128: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem17, ~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem17; {4710#false} is VALID [2018-11-23 10:02:53,935 INFO L273 TraceCheckUtils]: 127: Hoare triple {4710#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {4710#false} is VALID [2018-11-23 10:02:53,936 INFO L273 TraceCheckUtils]: 126: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem17, ~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem17; {4710#false} is VALID [2018-11-23 10:02:53,936 INFO L273 TraceCheckUtils]: 125: Hoare triple {4710#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {4710#false} is VALID [2018-11-23 10:02:53,936 INFO L273 TraceCheckUtils]: 124: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem17, ~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem17; {4710#false} is VALID [2018-11-23 10:02:53,936 INFO L273 TraceCheckUtils]: 123: Hoare triple {4710#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {4710#false} is VALID [2018-11-23 10:02:53,936 INFO L273 TraceCheckUtils]: 122: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem17, ~#a9~0.base, ~bvadd32(~#a9~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem17; {4710#false} is VALID [2018-11-23 10:02:53,936 INFO L273 TraceCheckUtils]: 121: Hoare triple {4710#false} ~i~0 := 0bv32; {4710#false} is VALID [2018-11-23 10:02:53,936 INFO L273 TraceCheckUtils]: 120: Hoare triple {4710#false} assume !~bvslt32(~i~0, 100000bv32); {4710#false} is VALID [2018-11-23 10:02:53,936 INFO L273 TraceCheckUtils]: 119: Hoare triple {4710#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {4710#false} is VALID [2018-11-23 10:02:53,937 INFO L273 TraceCheckUtils]: 118: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {4710#false} is VALID [2018-11-23 10:02:53,937 INFO L273 TraceCheckUtils]: 117: Hoare triple {4710#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {4710#false} is VALID [2018-11-23 10:02:53,937 INFO L273 TraceCheckUtils]: 116: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {4710#false} is VALID [2018-11-23 10:02:53,937 INFO L273 TraceCheckUtils]: 115: Hoare triple {4710#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {4710#false} is VALID [2018-11-23 10:02:53,937 INFO L273 TraceCheckUtils]: 114: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {4710#false} is VALID [2018-11-23 10:02:53,937 INFO L273 TraceCheckUtils]: 113: Hoare triple {4710#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {4710#false} is VALID [2018-11-23 10:02:53,937 INFO L273 TraceCheckUtils]: 112: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {4710#false} is VALID [2018-11-23 10:02:53,937 INFO L273 TraceCheckUtils]: 111: Hoare triple {4710#false} ~i~0 := 0bv32; {4710#false} is VALID [2018-11-23 10:02:53,938 INFO L273 TraceCheckUtils]: 110: Hoare triple {4710#false} assume !~bvslt32(~i~0, 100000bv32); {4710#false} is VALID [2018-11-23 10:02:53,938 INFO L273 TraceCheckUtils]: 109: Hoare triple {4710#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4710#false} is VALID [2018-11-23 10:02:53,938 INFO L273 TraceCheckUtils]: 108: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4710#false} is VALID [2018-11-23 10:02:53,938 INFO L273 TraceCheckUtils]: 107: Hoare triple {4710#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4710#false} is VALID [2018-11-23 10:02:53,938 INFO L273 TraceCheckUtils]: 106: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4710#false} is VALID [2018-11-23 10:02:53,938 INFO L273 TraceCheckUtils]: 105: Hoare triple {4710#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4710#false} is VALID [2018-11-23 10:02:53,938 INFO L273 TraceCheckUtils]: 104: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4710#false} is VALID [2018-11-23 10:02:53,938 INFO L273 TraceCheckUtils]: 103: Hoare triple {4710#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4710#false} is VALID [2018-11-23 10:02:53,938 INFO L273 TraceCheckUtils]: 102: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4710#false} is VALID [2018-11-23 10:02:53,939 INFO L273 TraceCheckUtils]: 101: Hoare triple {4710#false} ~i~0 := 0bv32; {4710#false} is VALID [2018-11-23 10:02:53,939 INFO L273 TraceCheckUtils]: 100: Hoare triple {4710#false} assume !~bvslt32(~i~0, 100000bv32); {4710#false} is VALID [2018-11-23 10:02:53,939 INFO L273 TraceCheckUtils]: 99: Hoare triple {4710#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4710#false} is VALID [2018-11-23 10:02:53,939 INFO L273 TraceCheckUtils]: 98: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4710#false} is VALID [2018-11-23 10:02:53,939 INFO L273 TraceCheckUtils]: 97: Hoare triple {4710#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4710#false} is VALID [2018-11-23 10:02:53,939 INFO L273 TraceCheckUtils]: 96: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4710#false} is VALID [2018-11-23 10:02:53,939 INFO L273 TraceCheckUtils]: 95: Hoare triple {4710#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4710#false} is VALID [2018-11-23 10:02:53,939 INFO L273 TraceCheckUtils]: 94: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4710#false} is VALID [2018-11-23 10:02:53,940 INFO L273 TraceCheckUtils]: 93: Hoare triple {4710#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4710#false} is VALID [2018-11-23 10:02:53,940 INFO L273 TraceCheckUtils]: 92: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4710#false} is VALID [2018-11-23 10:02:53,940 INFO L273 TraceCheckUtils]: 91: Hoare triple {4710#false} ~i~0 := 0bv32; {4710#false} is VALID [2018-11-23 10:02:53,940 INFO L273 TraceCheckUtils]: 90: Hoare triple {4710#false} assume !~bvslt32(~i~0, 100000bv32); {4710#false} is VALID [2018-11-23 10:02:53,940 INFO L273 TraceCheckUtils]: 89: Hoare triple {4710#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4710#false} is VALID [2018-11-23 10:02:53,940 INFO L273 TraceCheckUtils]: 88: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4710#false} is VALID [2018-11-23 10:02:53,940 INFO L273 TraceCheckUtils]: 87: Hoare triple {4710#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4710#false} is VALID [2018-11-23 10:02:53,940 INFO L273 TraceCheckUtils]: 86: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4710#false} is VALID [2018-11-23 10:02:53,941 INFO L273 TraceCheckUtils]: 85: Hoare triple {4710#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4710#false} is VALID [2018-11-23 10:02:53,941 INFO L273 TraceCheckUtils]: 84: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4710#false} is VALID [2018-11-23 10:02:53,941 INFO L273 TraceCheckUtils]: 83: Hoare triple {4710#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4710#false} is VALID [2018-11-23 10:02:53,941 INFO L273 TraceCheckUtils]: 82: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4710#false} is VALID [2018-11-23 10:02:53,941 INFO L273 TraceCheckUtils]: 81: Hoare triple {4710#false} ~i~0 := 0bv32; {4710#false} is VALID [2018-11-23 10:02:53,941 INFO L273 TraceCheckUtils]: 80: Hoare triple {4710#false} assume !~bvslt32(~i~0, 100000bv32); {4710#false} is VALID [2018-11-23 10:02:53,941 INFO L273 TraceCheckUtils]: 79: Hoare triple {4710#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4710#false} is VALID [2018-11-23 10:02:53,941 INFO L273 TraceCheckUtils]: 78: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4710#false} is VALID [2018-11-23 10:02:53,942 INFO L273 TraceCheckUtils]: 77: Hoare triple {4710#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4710#false} is VALID [2018-11-23 10:02:53,942 INFO L273 TraceCheckUtils]: 76: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4710#false} is VALID [2018-11-23 10:02:53,942 INFO L273 TraceCheckUtils]: 75: Hoare triple {4710#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4710#false} is VALID [2018-11-23 10:02:53,942 INFO L273 TraceCheckUtils]: 74: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4710#false} is VALID [2018-11-23 10:02:53,942 INFO L273 TraceCheckUtils]: 73: Hoare triple {4710#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4710#false} is VALID [2018-11-23 10:02:53,942 INFO L273 TraceCheckUtils]: 72: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4710#false} is VALID [2018-11-23 10:02:53,942 INFO L273 TraceCheckUtils]: 71: Hoare triple {4710#false} ~i~0 := 0bv32; {4710#false} is VALID [2018-11-23 10:02:53,942 INFO L273 TraceCheckUtils]: 70: Hoare triple {4710#false} assume !~bvslt32(~i~0, 100000bv32); {4710#false} is VALID [2018-11-23 10:02:53,943 INFO L273 TraceCheckUtils]: 69: Hoare triple {4710#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4710#false} is VALID [2018-11-23 10:02:53,943 INFO L273 TraceCheckUtils]: 68: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4710#false} is VALID [2018-11-23 10:02:53,943 INFO L273 TraceCheckUtils]: 67: Hoare triple {4710#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4710#false} is VALID [2018-11-23 10:02:53,943 INFO L273 TraceCheckUtils]: 66: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4710#false} is VALID [2018-11-23 10:02:53,943 INFO L273 TraceCheckUtils]: 65: Hoare triple {4710#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4710#false} is VALID [2018-11-23 10:02:53,943 INFO L273 TraceCheckUtils]: 64: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4710#false} is VALID [2018-11-23 10:02:53,944 INFO L273 TraceCheckUtils]: 63: Hoare triple {4710#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4710#false} is VALID [2018-11-23 10:02:53,944 INFO L273 TraceCheckUtils]: 62: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4710#false} is VALID [2018-11-23 10:02:53,944 INFO L273 TraceCheckUtils]: 61: Hoare triple {4710#false} ~i~0 := 0bv32; {4710#false} is VALID [2018-11-23 10:02:53,944 INFO L273 TraceCheckUtils]: 60: Hoare triple {4710#false} assume !~bvslt32(~i~0, 100000bv32); {4710#false} is VALID [2018-11-23 10:02:53,944 INFO L273 TraceCheckUtils]: 59: Hoare triple {4710#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4710#false} is VALID [2018-11-23 10:02:53,944 INFO L273 TraceCheckUtils]: 58: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4710#false} is VALID [2018-11-23 10:02:53,945 INFO L273 TraceCheckUtils]: 57: Hoare triple {4710#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4710#false} is VALID [2018-11-23 10:02:53,945 INFO L273 TraceCheckUtils]: 56: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4710#false} is VALID [2018-11-23 10:02:53,945 INFO L273 TraceCheckUtils]: 55: Hoare triple {4710#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4710#false} is VALID [2018-11-23 10:02:53,945 INFO L273 TraceCheckUtils]: 54: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4710#false} is VALID [2018-11-23 10:02:53,945 INFO L273 TraceCheckUtils]: 53: Hoare triple {4710#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4710#false} is VALID [2018-11-23 10:02:53,946 INFO L273 TraceCheckUtils]: 52: Hoare triple {4710#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4710#false} is VALID [2018-11-23 10:02:53,946 INFO L273 TraceCheckUtils]: 51: Hoare triple {4710#false} havoc ~i~0;~i~0 := 0bv32; {4710#false} is VALID [2018-11-23 10:02:53,967 INFO L273 TraceCheckUtils]: 50: Hoare triple {5403#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {4710#false} is VALID [2018-11-23 10:02:53,980 INFO L273 TraceCheckUtils]: 49: Hoare triple {5407#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5403#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:53,996 INFO L273 TraceCheckUtils]: 48: Hoare triple {5407#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5407#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,005 INFO L273 TraceCheckUtils]: 47: Hoare triple {5414#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5407#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,021 INFO L273 TraceCheckUtils]: 46: Hoare triple {5414#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5414#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,030 INFO L273 TraceCheckUtils]: 45: Hoare triple {5421#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5414#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,044 INFO L273 TraceCheckUtils]: 44: Hoare triple {5421#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5421#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,053 INFO L273 TraceCheckUtils]: 43: Hoare triple {5428#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5421#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,067 INFO L273 TraceCheckUtils]: 42: Hoare triple {5428#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5428#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,076 INFO L273 TraceCheckUtils]: 41: Hoare triple {5435#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5428#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,077 INFO L273 TraceCheckUtils]: 40: Hoare triple {5435#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5435#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,082 INFO L273 TraceCheckUtils]: 39: Hoare triple {5442#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5435#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,083 INFO L273 TraceCheckUtils]: 38: Hoare triple {5442#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5442#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,089 INFO L273 TraceCheckUtils]: 37: Hoare triple {5449#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5442#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,089 INFO L273 TraceCheckUtils]: 36: Hoare triple {5449#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5449#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,095 INFO L273 TraceCheckUtils]: 35: Hoare triple {5456#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5449#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,096 INFO L273 TraceCheckUtils]: 34: Hoare triple {5456#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5456#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,101 INFO L273 TraceCheckUtils]: 33: Hoare triple {5463#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5456#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,101 INFO L273 TraceCheckUtils]: 32: Hoare triple {5463#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5463#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,108 INFO L273 TraceCheckUtils]: 31: Hoare triple {5470#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5463#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,108 INFO L273 TraceCheckUtils]: 30: Hoare triple {5470#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5470#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,115 INFO L273 TraceCheckUtils]: 29: Hoare triple {5477#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5470#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,115 INFO L273 TraceCheckUtils]: 28: Hoare triple {5477#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5477#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,124 INFO L273 TraceCheckUtils]: 27: Hoare triple {5484#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5477#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,124 INFO L273 TraceCheckUtils]: 26: Hoare triple {5484#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5484#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,129 INFO L273 TraceCheckUtils]: 25: Hoare triple {5491#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5484#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,130 INFO L273 TraceCheckUtils]: 24: Hoare triple {5491#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5491#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,135 INFO L273 TraceCheckUtils]: 23: Hoare triple {5498#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5491#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,135 INFO L273 TraceCheckUtils]: 22: Hoare triple {5498#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5498#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,140 INFO L273 TraceCheckUtils]: 21: Hoare triple {5505#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5498#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,141 INFO L273 TraceCheckUtils]: 20: Hoare triple {5505#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5505#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,147 INFO L273 TraceCheckUtils]: 19: Hoare triple {5512#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5505#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,147 INFO L273 TraceCheckUtils]: 18: Hoare triple {5512#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5512#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,151 INFO L273 TraceCheckUtils]: 17: Hoare triple {5519#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5512#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,151 INFO L273 TraceCheckUtils]: 16: Hoare triple {5519#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5519#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,157 INFO L273 TraceCheckUtils]: 15: Hoare triple {5526#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5519#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,158 INFO L273 TraceCheckUtils]: 14: Hoare triple {5526#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5526#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,165 INFO L273 TraceCheckUtils]: 13: Hoare triple {5533#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5526#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,165 INFO L273 TraceCheckUtils]: 12: Hoare triple {5533#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5533#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {5540#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5533#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,172 INFO L273 TraceCheckUtils]: 10: Hoare triple {5540#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5540#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,179 INFO L273 TraceCheckUtils]: 9: Hoare triple {5547#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5540#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,179 INFO L273 TraceCheckUtils]: 8: Hoare triple {5547#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5547#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,186 INFO L273 TraceCheckUtils]: 7: Hoare triple {5554#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5547#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,186 INFO L273 TraceCheckUtils]: 6: Hoare triple {5554#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5554#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,188 INFO L273 TraceCheckUtils]: 5: Hoare triple {4709#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {5554#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:54,188 INFO L256 TraceCheckUtils]: 4: Hoare triple {4709#true} call #t~ret21 := main(); {4709#true} is VALID [2018-11-23 10:02:54,188 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4709#true} {4709#true} #161#return; {4709#true} is VALID [2018-11-23 10:02:54,188 INFO L273 TraceCheckUtils]: 2: Hoare triple {4709#true} assume true; {4709#true} is VALID [2018-11-23 10:02:54,188 INFO L273 TraceCheckUtils]: 1: Hoare triple {4709#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4709#true} is VALID [2018-11-23 10:02:54,188 INFO L256 TraceCheckUtils]: 0: Hoare triple {4709#true} call ULTIMATE.init(); {4709#true} is VALID [2018-11-23 10:02:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-23 10:02:54,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:54,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:02:54,207 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 137 [2018-11-23 10:02:54,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:54,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:02:54,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:54,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:02:54,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:02:54,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:02:54,559 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 48 states. [2018-11-23 10:02:59,664 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:03:00,163 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:03:00,673 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:03:01,190 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:03:01,751 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:03:02,345 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:03:03,532 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 10:03:12,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:12,327 INFO L93 Difference]: Finished difference Result 281 states and 322 transitions. [2018-11-23 10:03:12,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:03:12,327 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 137 [2018-11-23 10:03:12,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:03:12,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:03:12,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 210 transitions. [2018-11-23 10:03:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:03:12,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 210 transitions. [2018-11-23 10:03:12,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 210 transitions. [2018-11-23 10:03:12,725 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:03:12,731 INFO L225 Difference]: With dead ends: 281 [2018-11-23 10:03:12,731 INFO L226 Difference]: Without dead ends: 190 [2018-11-23 10:03:12,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:03:12,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-23 10:03:13,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-11-23 10:03:13,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:03:13,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand 190 states. [2018-11-23 10:03:13,401 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand 190 states. [2018-11-23 10:03:13,401 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 190 states. [2018-11-23 10:03:13,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:13,407 INFO L93 Difference]: Finished difference Result 190 states and 199 transitions. [2018-11-23 10:03:13,407 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 199 transitions. [2018-11-23 10:03:13,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:03:13,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:03:13,408 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand 190 states. [2018-11-23 10:03:13,408 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 190 states. [2018-11-23 10:03:13,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:13,414 INFO L93 Difference]: Finished difference Result 190 states and 199 transitions. [2018-11-23 10:03:13,414 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 199 transitions. [2018-11-23 10:03:13,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:03:13,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:03:13,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:03:13,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:03:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-23 10:03:13,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 199 transitions. [2018-11-23 10:03:13,420 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 199 transitions. Word has length 137 [2018-11-23 10:03:13,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:03:13,421 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 199 transitions. [2018-11-23 10:03:13,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:03:13,421 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 199 transitions. [2018-11-23 10:03:13,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-23 10:03:13,424 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:03:13,424 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:03:13,424 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:03:13,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:03:13,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1364066486, now seen corresponding path program 5 times [2018-11-23 10:03:13,425 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:03:13,425 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:03:13,450 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1