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_copy3_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:02:29,227 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:02:29,229 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:02:29,241 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:02:29,241 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:02:29,242 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:02:29,243 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:02:29,245 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:02:29,247 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:02:29,248 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:02:29,249 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:02:29,249 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:02:29,250 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:02:29,251 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:02:29,252 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:02:29,253 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:02:29,254 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:02:29,256 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:02:29,258 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:02:29,260 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:02:29,261 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:02:29,262 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:02:29,265 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:02:29,266 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:02:29,266 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:02:29,267 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:02:29,268 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:02:29,269 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:02:29,270 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:02:29,271 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:02:29,272 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:02:29,272 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:02:29,273 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:02:29,273 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:02:29,274 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:02:29,275 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:02:29,275 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:29,304 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:02:29,304 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:02:29,305 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:02:29,305 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:02:29,306 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:02:29,306 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:02:29,307 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:02:29,307 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:02:29,307 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:02:29,307 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:02:29,307 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:02:29,308 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:02:29,308 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:02:29,308 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:02:29,308 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:02:29,308 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:02:29,309 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:02:29,310 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:02:29,310 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:02:29,311 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:02:29,311 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:02:29,311 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:02:29,311 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:02:29,311 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:02:29,312 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:02:29,312 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:02:29,312 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:02:29,312 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:02:29,313 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:02:29,313 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:02:29,313 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:02:29,313 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:02:29,313 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:02:29,386 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:02:29,399 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:02:29,407 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:02:29,408 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:02:29,409 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:02:29,410 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy3_true-unreach-call_ground.i [2018-11-23 10:02:29,488 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ddb9f767/a1f6511ddb80405ca72890e3b5001cdb/FLAGdfac907b5 [2018-11-23 10:02:29,986 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:02:29,987 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy3_true-unreach-call_ground.i [2018-11-23 10:02:29,994 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ddb9f767/a1f6511ddb80405ca72890e3b5001cdb/FLAGdfac907b5 [2018-11-23 10:02:30,344 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ddb9f767/a1f6511ddb80405ca72890e3b5001cdb [2018-11-23 10:02:30,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:02:30,355 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:02:30,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:02:30,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:02:30,359 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:02:30,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:02:30" (1/1) ... [2018-11-23 10:02:30,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e02680f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:30, skipping insertion in model container [2018-11-23 10:02:30,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:02:30" (1/1) ... [2018-11-23 10:02:30,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:02:30,396 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:02:30,630 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:02:30,636 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:02:30,663 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:02:30,688 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:02:30,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:30 WrapperNode [2018-11-23 10:02:30,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:02:30,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:02:30,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:02:30,690 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:02:30,699 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:30" (1/1) ... [2018-11-23 10:02:30,710 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:30" (1/1) ... [2018-11-23 10:02:30,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:02:30,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:02:30,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:02:30,718 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:02:30,726 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:30" (1/1) ... [2018-11-23 10:02:30,726 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:30" (1/1) ... [2018-11-23 10:02:30,729 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:30" (1/1) ... [2018-11-23 10:02:30,730 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:30" (1/1) ... [2018-11-23 10:02:30,745 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:30" (1/1) ... [2018-11-23 10:02:30,753 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:30" (1/1) ... [2018-11-23 10:02:30,755 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:30" (1/1) ... [2018-11-23 10:02:30,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:02:30,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:02:30,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:02:30,759 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:02:30,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:30" (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:30,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:02:30,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:02:30,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:02:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:02:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:02:30,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:02:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:02:30,892 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:02:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:02:30,893 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:02:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:02:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:02:31,613 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:02:31,614 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 10:02:31,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:31 BoogieIcfgContainer [2018-11-23 10:02:31,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:02:31,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:02:31,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:02:31,619 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:02:31,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:02:30" (1/3) ... [2018-11-23 10:02:31,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e040d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:02:31, skipping insertion in model container [2018-11-23 10:02:31,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:30" (2/3) ... [2018-11-23 10:02:31,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e040d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:02:31, skipping insertion in model container [2018-11-23 10:02:31,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:31" (3/3) ... [2018-11-23 10:02:31,623 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy3_true-unreach-call_ground.i [2018-11-23 10:02:31,632 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:02:31,639 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:02:31,654 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:02:31,687 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:02:31,687 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:02:31,688 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:02:31,688 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:02:31,689 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:02:31,689 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:02:31,689 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:02:31,689 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:02:31,689 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:02:31,707 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-23 10:02:31,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 10:02:31,714 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:31,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:31,720 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:31,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:31,727 INFO L82 PathProgramCache]: Analyzing trace with hash -496428460, now seen corresponding path program 1 times [2018-11-23 10:02:31,731 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:31,732 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:31,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:31,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:31,996 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-23 10:02:31,999 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {36#true} is VALID [2018-11-23 10:02:32,000 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-23 10:02:32,001 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #91#return; {36#true} is VALID [2018-11-23 10:02:32,001 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret11 := main(); {36#true} is VALID [2018-11-23 10:02:32,001 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#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);havoc ~a~0;~a~0 := 0bv32; {36#true} is VALID [2018-11-23 10:02:32,002 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-23 10:02:32,002 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#false} havoc ~i~0;~i~0 := 0bv32; {37#false} is VALID [2018-11-23 10:02:32,003 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#false} assume !~bvslt32(~i~0, 100000bv32); {37#false} is VALID [2018-11-23 10:02:32,003 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#false} ~i~0 := 0bv32; {37#false} is VALID [2018-11-23 10:02:32,003 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#false} assume !~bvslt32(~i~0, 100000bv32); {37#false} is VALID [2018-11-23 10:02:32,004 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} ~i~0 := 0bv32; {37#false} is VALID [2018-11-23 10:02:32,004 INFO L273 TraceCheckUtils]: 12: Hoare triple {37#false} assume !~bvslt32(~i~0, 100000bv32); {37#false} is VALID [2018-11-23 10:02:32,004 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} havoc ~x~0;~x~0 := 0bv32; {37#false} is VALID [2018-11-23 10:02:32,005 INFO L273 TraceCheckUtils]: 14: Hoare triple {37#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {37#false} is VALID [2018-11-23 10:02:32,005 INFO L256 TraceCheckUtils]: 15: Hoare triple {37#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1bv32 else 0bv32)); {37#false} is VALID [2018-11-23 10:02:32,006 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2018-11-23 10:02:32,006 INFO L273 TraceCheckUtils]: 17: Hoare triple {37#false} assume 0bv32 == ~cond; {37#false} is VALID [2018-11-23 10:02:32,007 INFO L273 TraceCheckUtils]: 18: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-23 10:02:32,011 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:32,011 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:32,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:32,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:02:32,025 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 10:02:32,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:32,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:02:32,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:32,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:02:32,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:02:32,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:02:32,270 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-23 10:02:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:32,411 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2018-11-23 10:02:32,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:02:32,412 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 10:02:32,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:02:32,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-23 10:02:32,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:02:32,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-23 10:02:32,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 77 transitions. [2018-11-23 10:02:32,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:32,748 INFO L225 Difference]: With dead ends: 58 [2018-11-23 10:02:32,748 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 10:02:32,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:02:32,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 10:02:32,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 10:02:32,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:32,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 10:02:32,796 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 10:02:32,796 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 10:02:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:32,801 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 10:02:32,802 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 10:02:32,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:32,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:32,803 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 10:02:32,803 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 10:02:32,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:32,807 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 10:02:32,808 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 10:02:32,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:32,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:32,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:32,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:32,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 10:02:32,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 10:02:32,814 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2018-11-23 10:02:32,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:32,814 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 10:02:32,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:02:32,815 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 10:02:32,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 10:02:32,816 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:32,816 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:32,816 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:32,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:32,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1263989582, now seen corresponding path program 1 times [2018-11-23 10:02:32,818 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:32,818 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:32,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:32,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:33,086 INFO L256 TraceCheckUtils]: 0: Hoare triple {264#true} call ULTIMATE.init(); {264#true} is VALID [2018-11-23 10:02:33,086 INFO L273 TraceCheckUtils]: 1: Hoare triple {264#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {264#true} is VALID [2018-11-23 10:02:33,087 INFO L273 TraceCheckUtils]: 2: Hoare triple {264#true} assume true; {264#true} is VALID [2018-11-23 10:02:33,087 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {264#true} {264#true} #91#return; {264#true} is VALID [2018-11-23 10:02:33,087 INFO L256 TraceCheckUtils]: 4: Hoare triple {264#true} call #t~ret11 := main(); {264#true} is VALID [2018-11-23 10:02:33,100 INFO L273 TraceCheckUtils]: 5: Hoare triple {264#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);havoc ~a~0;~a~0 := 0bv32; {284#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:33,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {284#(= main_~a~0 (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {265#false} is VALID [2018-11-23 10:02:33,114 INFO L273 TraceCheckUtils]: 7: Hoare triple {265#false} havoc ~i~0;~i~0 := 0bv32; {265#false} is VALID [2018-11-23 10:02:33,115 INFO L273 TraceCheckUtils]: 8: Hoare triple {265#false} assume !~bvslt32(~i~0, 100000bv32); {265#false} is VALID [2018-11-23 10:02:33,115 INFO L273 TraceCheckUtils]: 9: Hoare triple {265#false} ~i~0 := 0bv32; {265#false} is VALID [2018-11-23 10:02:33,115 INFO L273 TraceCheckUtils]: 10: Hoare triple {265#false} assume !~bvslt32(~i~0, 100000bv32); {265#false} is VALID [2018-11-23 10:02:33,116 INFO L273 TraceCheckUtils]: 11: Hoare triple {265#false} ~i~0 := 0bv32; {265#false} is VALID [2018-11-23 10:02:33,116 INFO L273 TraceCheckUtils]: 12: Hoare triple {265#false} assume !~bvslt32(~i~0, 100000bv32); {265#false} is VALID [2018-11-23 10:02:33,116 INFO L273 TraceCheckUtils]: 13: Hoare triple {265#false} havoc ~x~0;~x~0 := 0bv32; {265#false} is VALID [2018-11-23 10:02:33,117 INFO L273 TraceCheckUtils]: 14: Hoare triple {265#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {265#false} is VALID [2018-11-23 10:02:33,117 INFO L256 TraceCheckUtils]: 15: Hoare triple {265#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1bv32 else 0bv32)); {265#false} is VALID [2018-11-23 10:02:33,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {265#false} ~cond := #in~cond; {265#false} is VALID [2018-11-23 10:02:33,118 INFO L273 TraceCheckUtils]: 17: Hoare triple {265#false} assume 0bv32 == ~cond; {265#false} is VALID [2018-11-23 10:02:33,118 INFO L273 TraceCheckUtils]: 18: Hoare triple {265#false} assume !false; {265#false} is VALID [2018-11-23 10:02:33,120 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:33,120 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:33,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:33,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:02:33,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:02:33,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:33,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:02:33,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:33,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:02:33,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:02:33,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:33,323 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-23 10:02:33,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:33,662 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-23 10:02:33,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:02:33,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:02:33,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:33,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:33,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-23 10:02:33,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:33,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-23 10:02:33,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2018-11-23 10:02:33,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:33,808 INFO L225 Difference]: With dead ends: 50 [2018-11-23 10:02:33,808 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 10:02:33,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:33,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 10:02:33,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 10:02:33,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:33,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 10:02:33,831 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 10:02:33,831 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 10:02:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:33,834 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 10:02:33,834 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 10:02:33,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:33,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:33,835 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 10:02:33,835 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 10:02:33,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:33,838 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 10:02:33,838 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 10:02:33,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:33,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:33,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:33,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 10:02:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 10:02:33,841 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 19 [2018-11-23 10:02:33,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:33,842 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 10:02:33,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:02:33,842 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 10:02:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:02:33,843 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:33,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:33,843 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:33,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:33,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1258945684, now seen corresponding path program 1 times [2018-11-23 10:02:33,845 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:33,845 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:33,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:33,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:33,985 INFO L256 TraceCheckUtils]: 0: Hoare triple {492#true} call ULTIMATE.init(); {492#true} is VALID [2018-11-23 10:02:33,986 INFO L273 TraceCheckUtils]: 1: Hoare triple {492#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {492#true} is VALID [2018-11-23 10:02:33,986 INFO L273 TraceCheckUtils]: 2: Hoare triple {492#true} assume true; {492#true} is VALID [2018-11-23 10:02:33,986 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {492#true} {492#true} #91#return; {492#true} is VALID [2018-11-23 10:02:33,987 INFO L256 TraceCheckUtils]: 4: Hoare triple {492#true} call #t~ret11 := main(); {492#true} is VALID [2018-11-23 10:02:33,988 INFO L273 TraceCheckUtils]: 5: Hoare triple {492#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);havoc ~a~0;~a~0 := 0bv32; {512#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:33,990 INFO L273 TraceCheckUtils]: 6: Hoare triple {512#(= 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; {512#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:34,004 INFO L273 TraceCheckUtils]: 7: Hoare triple {512#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {519#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:34,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {519#(= (_ bv1 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {493#false} is VALID [2018-11-23 10:02:34,005 INFO L273 TraceCheckUtils]: 9: Hoare triple {493#false} havoc ~i~0;~i~0 := 0bv32; {493#false} is VALID [2018-11-23 10:02:34,006 INFO L273 TraceCheckUtils]: 10: Hoare triple {493#false} assume !~bvslt32(~i~0, 100000bv32); {493#false} is VALID [2018-11-23 10:02:34,006 INFO L273 TraceCheckUtils]: 11: Hoare triple {493#false} ~i~0 := 0bv32; {493#false} is VALID [2018-11-23 10:02:34,006 INFO L273 TraceCheckUtils]: 12: Hoare triple {493#false} assume !~bvslt32(~i~0, 100000bv32); {493#false} is VALID [2018-11-23 10:02:34,007 INFO L273 TraceCheckUtils]: 13: Hoare triple {493#false} ~i~0 := 0bv32; {493#false} is VALID [2018-11-23 10:02:34,007 INFO L273 TraceCheckUtils]: 14: Hoare triple {493#false} assume !~bvslt32(~i~0, 100000bv32); {493#false} is VALID [2018-11-23 10:02:34,007 INFO L273 TraceCheckUtils]: 15: Hoare triple {493#false} havoc ~x~0;~x~0 := 0bv32; {493#false} is VALID [2018-11-23 10:02:34,008 INFO L273 TraceCheckUtils]: 16: Hoare triple {493#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {493#false} is VALID [2018-11-23 10:02:34,008 INFO L256 TraceCheckUtils]: 17: Hoare triple {493#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1bv32 else 0bv32)); {493#false} is VALID [2018-11-23 10:02:34,008 INFO L273 TraceCheckUtils]: 18: Hoare triple {493#false} ~cond := #in~cond; {493#false} is VALID [2018-11-23 10:02:34,008 INFO L273 TraceCheckUtils]: 19: Hoare triple {493#false} assume 0bv32 == ~cond; {493#false} is VALID [2018-11-23 10:02:34,009 INFO L273 TraceCheckUtils]: 20: Hoare triple {493#false} assume !false; {493#false} is VALID [2018-11-23 10:02:34,010 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:34,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:34,159 INFO L273 TraceCheckUtils]: 20: Hoare triple {493#false} assume !false; {493#false} is VALID [2018-11-23 10:02:34,159 INFO L273 TraceCheckUtils]: 19: Hoare triple {493#false} assume 0bv32 == ~cond; {493#false} is VALID [2018-11-23 10:02:34,160 INFO L273 TraceCheckUtils]: 18: Hoare triple {493#false} ~cond := #in~cond; {493#false} is VALID [2018-11-23 10:02:34,160 INFO L256 TraceCheckUtils]: 17: Hoare triple {493#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1bv32 else 0bv32)); {493#false} is VALID [2018-11-23 10:02:34,160 INFO L273 TraceCheckUtils]: 16: Hoare triple {493#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {493#false} is VALID [2018-11-23 10:02:34,161 INFO L273 TraceCheckUtils]: 15: Hoare triple {493#false} havoc ~x~0;~x~0 := 0bv32; {493#false} is VALID [2018-11-23 10:02:34,161 INFO L273 TraceCheckUtils]: 14: Hoare triple {493#false} assume !~bvslt32(~i~0, 100000bv32); {493#false} is VALID [2018-11-23 10:02:34,161 INFO L273 TraceCheckUtils]: 13: Hoare triple {493#false} ~i~0 := 0bv32; {493#false} is VALID [2018-11-23 10:02:34,162 INFO L273 TraceCheckUtils]: 12: Hoare triple {493#false} assume !~bvslt32(~i~0, 100000bv32); {493#false} is VALID [2018-11-23 10:02:34,162 INFO L273 TraceCheckUtils]: 11: Hoare triple {493#false} ~i~0 := 0bv32; {493#false} is VALID [2018-11-23 10:02:34,163 INFO L273 TraceCheckUtils]: 10: Hoare triple {493#false} assume !~bvslt32(~i~0, 100000bv32); {493#false} is VALID [2018-11-23 10:02:34,163 INFO L273 TraceCheckUtils]: 9: Hoare triple {493#false} havoc ~i~0;~i~0 := 0bv32; {493#false} is VALID [2018-11-23 10:02:34,164 INFO L273 TraceCheckUtils]: 8: Hoare triple {595#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {493#false} is VALID [2018-11-23 10:02:34,176 INFO L273 TraceCheckUtils]: 7: Hoare triple {599#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {595#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:34,177 INFO L273 TraceCheckUtils]: 6: Hoare triple {599#(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; {599#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:34,179 INFO L273 TraceCheckUtils]: 5: Hoare triple {492#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);havoc ~a~0;~a~0 := 0bv32; {599#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:34,179 INFO L256 TraceCheckUtils]: 4: Hoare triple {492#true} call #t~ret11 := main(); {492#true} is VALID [2018-11-23 10:02:34,180 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {492#true} {492#true} #91#return; {492#true} is VALID [2018-11-23 10:02:34,180 INFO L273 TraceCheckUtils]: 2: Hoare triple {492#true} assume true; {492#true} is VALID [2018-11-23 10:02:34,180 INFO L273 TraceCheckUtils]: 1: Hoare triple {492#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {492#true} is VALID [2018-11-23 10:02:34,181 INFO L256 TraceCheckUtils]: 0: Hoare triple {492#true} call ULTIMATE.init(); {492#true} is VALID [2018-11-23 10:02:34,182 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:34,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:34,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:02:34,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 10:02:34,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:34,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:02:34,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:34,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:02:34,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:02:34,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:02:34,292 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 6 states. [2018-11-23 10:02:34,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:34,721 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-11-23 10:02:34,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:02:34,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 10:02:34,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2018-11-23 10:02:34,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:34,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2018-11-23 10:02:34,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2018-11-23 10:02:34,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:34,876 INFO L225 Difference]: With dead ends: 55 [2018-11-23 10:02:34,877 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 10:02:34,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:02:34,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 10:02:34,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 10:02:34,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:34,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-23 10:02:34,894 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 10:02:34,895 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 10:02:34,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:34,897 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 10:02:34,898 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 10:02:34,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:34,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:34,899 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 10:02:34,899 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 10:02:34,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:34,902 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 10:02:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 10:02:34,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:34,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:34,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:34,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:34,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 10:02:34,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-23 10:02:34,906 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 21 [2018-11-23 10:02:34,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:34,906 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-23 10:02:34,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:02:34,906 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 10:02:34,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:02:34,907 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:34,908 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] [2018-11-23 10:02:34,908 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:34,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:34,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1520609594, now seen corresponding path program 2 times [2018-11-23 10:02:34,912 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:34,912 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:34,932 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:02:34,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 10:02:34,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:34,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:35,028 INFO L256 TraceCheckUtils]: 0: Hoare triple {821#true} call ULTIMATE.init(); {821#true} is VALID [2018-11-23 10:02:35,029 INFO L273 TraceCheckUtils]: 1: Hoare triple {821#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {821#true} is VALID [2018-11-23 10:02:35,030 INFO L273 TraceCheckUtils]: 2: Hoare triple {821#true} assume true; {821#true} is VALID [2018-11-23 10:02:35,030 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {821#true} {821#true} #91#return; {821#true} is VALID [2018-11-23 10:02:35,030 INFO L256 TraceCheckUtils]: 4: Hoare triple {821#true} call #t~ret11 := main(); {821#true} is VALID [2018-11-23 10:02:35,031 INFO L273 TraceCheckUtils]: 5: Hoare triple {821#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);havoc ~a~0;~a~0 := 0bv32; {821#true} is VALID [2018-11-23 10:02:35,031 INFO L273 TraceCheckUtils]: 6: Hoare triple {821#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; {821#true} is VALID [2018-11-23 10:02:35,032 INFO L273 TraceCheckUtils]: 7: Hoare triple {821#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {821#true} is VALID [2018-11-23 10:02:35,032 INFO L273 TraceCheckUtils]: 8: Hoare triple {821#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; {821#true} is VALID [2018-11-23 10:02:35,032 INFO L273 TraceCheckUtils]: 9: Hoare triple {821#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {821#true} is VALID [2018-11-23 10:02:35,032 INFO L273 TraceCheckUtils]: 10: Hoare triple {821#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; {821#true} is VALID [2018-11-23 10:02:35,033 INFO L273 TraceCheckUtils]: 11: Hoare triple {821#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {821#true} is VALID [2018-11-23 10:02:35,033 INFO L273 TraceCheckUtils]: 12: Hoare triple {821#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; {821#true} is VALID [2018-11-23 10:02:35,033 INFO L273 TraceCheckUtils]: 13: Hoare triple {821#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {821#true} is VALID [2018-11-23 10:02:35,033 INFO L273 TraceCheckUtils]: 14: Hoare triple {821#true} assume !~bvslt32(~a~0, 100000bv32); {821#true} is VALID [2018-11-23 10:02:35,034 INFO L273 TraceCheckUtils]: 15: Hoare triple {821#true} havoc ~i~0;~i~0 := 0bv32; {871#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:35,034 INFO L273 TraceCheckUtils]: 16: Hoare triple {871#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {822#false} is VALID [2018-11-23 10:02:35,035 INFO L273 TraceCheckUtils]: 17: Hoare triple {822#false} ~i~0 := 0bv32; {822#false} is VALID [2018-11-23 10:02:35,035 INFO L273 TraceCheckUtils]: 18: Hoare triple {822#false} assume !~bvslt32(~i~0, 100000bv32); {822#false} is VALID [2018-11-23 10:02:35,035 INFO L273 TraceCheckUtils]: 19: Hoare triple {822#false} ~i~0 := 0bv32; {822#false} is VALID [2018-11-23 10:02:35,035 INFO L273 TraceCheckUtils]: 20: Hoare triple {822#false} assume !~bvslt32(~i~0, 100000bv32); {822#false} is VALID [2018-11-23 10:02:35,036 INFO L273 TraceCheckUtils]: 21: Hoare triple {822#false} havoc ~x~0;~x~0 := 0bv32; {822#false} is VALID [2018-11-23 10:02:35,036 INFO L273 TraceCheckUtils]: 22: Hoare triple {822#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {822#false} is VALID [2018-11-23 10:02:35,036 INFO L256 TraceCheckUtils]: 23: Hoare triple {822#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1bv32 else 0bv32)); {822#false} is VALID [2018-11-23 10:02:35,036 INFO L273 TraceCheckUtils]: 24: Hoare triple {822#false} ~cond := #in~cond; {822#false} is VALID [2018-11-23 10:02:35,037 INFO L273 TraceCheckUtils]: 25: Hoare triple {822#false} assume 0bv32 == ~cond; {822#false} is VALID [2018-11-23 10:02:35,037 INFO L273 TraceCheckUtils]: 26: Hoare triple {822#false} assume !false; {822#false} is VALID [2018-11-23 10:02:35,039 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:35,039 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:35,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:35,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:02:35,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:02:35,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:35,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:02:35,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:35,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:02:35,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:02:35,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:35,087 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 3 states. [2018-11-23 10:02:35,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:35,264 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-11-23 10:02:35,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:02:35,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:02:35,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:35,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-23 10:02:35,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:35,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-23 10:02:35,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2018-11-23 10:02:35,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:35,405 INFO L225 Difference]: With dead ends: 58 [2018-11-23 10:02:35,405 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 10:02:35,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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:35,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 10:02:35,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-11-23 10:02:35,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:35,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 38 states. [2018-11-23 10:02:35,424 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 38 states. [2018-11-23 10:02:35,424 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 38 states. [2018-11-23 10:02:35,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:35,427 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-23 10:02:35,427 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 10:02:35,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:35,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:35,428 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 41 states. [2018-11-23 10:02:35,428 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 41 states. [2018-11-23 10:02:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:35,431 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-23 10:02:35,431 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 10:02:35,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:35,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:35,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:35,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:35,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 10:02:35,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-23 10:02:35,435 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 27 [2018-11-23 10:02:35,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:35,436 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-23 10:02:35,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:02:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 10:02:35,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 10:02:35,437 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:35,437 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] [2018-11-23 10:02:35,438 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:35,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:35,438 INFO L82 PathProgramCache]: Analyzing trace with hash 2019450144, now seen corresponding path program 1 times [2018-11-23 10:02:35,439 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:35,439 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:35,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:02:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:35,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:35,637 INFO L256 TraceCheckUtils]: 0: Hoare triple {1123#true} call ULTIMATE.init(); {1123#true} is VALID [2018-11-23 10:02:35,638 INFO L273 TraceCheckUtils]: 1: Hoare triple {1123#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1123#true} is VALID [2018-11-23 10:02:35,638 INFO L273 TraceCheckUtils]: 2: Hoare triple {1123#true} assume true; {1123#true} is VALID [2018-11-23 10:02:35,639 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1123#true} {1123#true} #91#return; {1123#true} is VALID [2018-11-23 10:02:35,639 INFO L256 TraceCheckUtils]: 4: Hoare triple {1123#true} call #t~ret11 := main(); {1123#true} is VALID [2018-11-23 10:02:35,640 INFO L273 TraceCheckUtils]: 5: Hoare triple {1123#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);havoc ~a~0;~a~0 := 0bv32; {1143#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:35,642 INFO L273 TraceCheckUtils]: 6: Hoare triple {1143#(= 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; {1143#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:35,642 INFO L273 TraceCheckUtils]: 7: Hoare triple {1143#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1150#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:35,644 INFO L273 TraceCheckUtils]: 8: Hoare triple {1150#(= (_ 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; {1150#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:35,655 INFO L273 TraceCheckUtils]: 9: Hoare triple {1150#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1157#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:35,656 INFO L273 TraceCheckUtils]: 10: Hoare triple {1157#(= (_ 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; {1157#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:35,657 INFO L273 TraceCheckUtils]: 11: Hoare triple {1157#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1164#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:35,658 INFO L273 TraceCheckUtils]: 12: Hoare triple {1164#(= (_ 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; {1164#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:35,660 INFO L273 TraceCheckUtils]: 13: Hoare triple {1164#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1171#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:35,676 INFO L273 TraceCheckUtils]: 14: Hoare triple {1171#(= (_ bv4 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1124#false} is VALID [2018-11-23 10:02:35,676 INFO L273 TraceCheckUtils]: 15: Hoare triple {1124#false} havoc ~i~0;~i~0 := 0bv32; {1124#false} is VALID [2018-11-23 10:02:35,676 INFO L273 TraceCheckUtils]: 16: Hoare triple {1124#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; {1124#false} is VALID [2018-11-23 10:02:35,677 INFO L273 TraceCheckUtils]: 17: Hoare triple {1124#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1124#false} is VALID [2018-11-23 10:02:35,677 INFO L273 TraceCheckUtils]: 18: Hoare triple {1124#false} assume !~bvslt32(~i~0, 100000bv32); {1124#false} is VALID [2018-11-23 10:02:35,677 INFO L273 TraceCheckUtils]: 19: Hoare triple {1124#false} ~i~0 := 0bv32; {1124#false} is VALID [2018-11-23 10:02:35,678 INFO L273 TraceCheckUtils]: 20: Hoare triple {1124#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; {1124#false} is VALID [2018-11-23 10:02:35,678 INFO L273 TraceCheckUtils]: 21: Hoare triple {1124#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1124#false} is VALID [2018-11-23 10:02:35,679 INFO L273 TraceCheckUtils]: 22: Hoare triple {1124#false} assume !~bvslt32(~i~0, 100000bv32); {1124#false} is VALID [2018-11-23 10:02:35,679 INFO L273 TraceCheckUtils]: 23: Hoare triple {1124#false} ~i~0 := 0bv32; {1124#false} is VALID [2018-11-23 10:02:35,679 INFO L273 TraceCheckUtils]: 24: Hoare triple {1124#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; {1124#false} is VALID [2018-11-23 10:02:35,679 INFO L273 TraceCheckUtils]: 25: Hoare triple {1124#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1124#false} is VALID [2018-11-23 10:02:35,680 INFO L273 TraceCheckUtils]: 26: Hoare triple {1124#false} assume !~bvslt32(~i~0, 100000bv32); {1124#false} is VALID [2018-11-23 10:02:35,680 INFO L273 TraceCheckUtils]: 27: Hoare triple {1124#false} havoc ~x~0;~x~0 := 0bv32; {1124#false} is VALID [2018-11-23 10:02:35,680 INFO L273 TraceCheckUtils]: 28: Hoare triple {1124#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1124#false} is VALID [2018-11-23 10:02:35,681 INFO L256 TraceCheckUtils]: 29: Hoare triple {1124#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1bv32 else 0bv32)); {1124#false} is VALID [2018-11-23 10:02:35,681 INFO L273 TraceCheckUtils]: 30: Hoare triple {1124#false} ~cond := #in~cond; {1124#false} is VALID [2018-11-23 10:02:35,681 INFO L273 TraceCheckUtils]: 31: Hoare triple {1124#false} assume 0bv32 == ~cond; {1124#false} is VALID [2018-11-23 10:02:35,681 INFO L273 TraceCheckUtils]: 32: Hoare triple {1124#false} assume !false; {1124#false} is VALID [2018-11-23 10:02:35,684 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 10:02:35,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:35,980 INFO L273 TraceCheckUtils]: 32: Hoare triple {1124#false} assume !false; {1124#false} is VALID [2018-11-23 10:02:35,981 INFO L273 TraceCheckUtils]: 31: Hoare triple {1124#false} assume 0bv32 == ~cond; {1124#false} is VALID [2018-11-23 10:02:35,981 INFO L273 TraceCheckUtils]: 30: Hoare triple {1124#false} ~cond := #in~cond; {1124#false} is VALID [2018-11-23 10:02:35,982 INFO L256 TraceCheckUtils]: 29: Hoare triple {1124#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1bv32 else 0bv32)); {1124#false} is VALID [2018-11-23 10:02:35,982 INFO L273 TraceCheckUtils]: 28: Hoare triple {1124#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1124#false} is VALID [2018-11-23 10:02:35,982 INFO L273 TraceCheckUtils]: 27: Hoare triple {1124#false} havoc ~x~0;~x~0 := 0bv32; {1124#false} is VALID [2018-11-23 10:02:35,983 INFO L273 TraceCheckUtils]: 26: Hoare triple {1124#false} assume !~bvslt32(~i~0, 100000bv32); {1124#false} is VALID [2018-11-23 10:02:35,983 INFO L273 TraceCheckUtils]: 25: Hoare triple {1124#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1124#false} is VALID [2018-11-23 10:02:35,983 INFO L273 TraceCheckUtils]: 24: Hoare triple {1124#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; {1124#false} is VALID [2018-11-23 10:02:35,983 INFO L273 TraceCheckUtils]: 23: Hoare triple {1124#false} ~i~0 := 0bv32; {1124#false} is VALID [2018-11-23 10:02:35,984 INFO L273 TraceCheckUtils]: 22: Hoare triple {1124#false} assume !~bvslt32(~i~0, 100000bv32); {1124#false} is VALID [2018-11-23 10:02:35,984 INFO L273 TraceCheckUtils]: 21: Hoare triple {1124#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1124#false} is VALID [2018-11-23 10:02:35,984 INFO L273 TraceCheckUtils]: 20: Hoare triple {1124#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; {1124#false} is VALID [2018-11-23 10:02:35,984 INFO L273 TraceCheckUtils]: 19: Hoare triple {1124#false} ~i~0 := 0bv32; {1124#false} is VALID [2018-11-23 10:02:35,985 INFO L273 TraceCheckUtils]: 18: Hoare triple {1124#false} assume !~bvslt32(~i~0, 100000bv32); {1124#false} is VALID [2018-11-23 10:02:35,985 INFO L273 TraceCheckUtils]: 17: Hoare triple {1124#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1124#false} is VALID [2018-11-23 10:02:35,985 INFO L273 TraceCheckUtils]: 16: Hoare triple {1124#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; {1124#false} is VALID [2018-11-23 10:02:35,986 INFO L273 TraceCheckUtils]: 15: Hoare triple {1124#false} havoc ~i~0;~i~0 := 0bv32; {1124#false} is VALID [2018-11-23 10:02:35,986 INFO L273 TraceCheckUtils]: 14: Hoare triple {1283#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1124#false} is VALID [2018-11-23 10:02:35,987 INFO L273 TraceCheckUtils]: 13: Hoare triple {1287#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1283#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:35,988 INFO L273 TraceCheckUtils]: 12: Hoare triple {1287#(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; {1287#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:35,994 INFO L273 TraceCheckUtils]: 11: Hoare triple {1294#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1287#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:35,995 INFO L273 TraceCheckUtils]: 10: Hoare triple {1294#(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; {1294#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,000 INFO L273 TraceCheckUtils]: 9: Hoare triple {1301#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1294#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,000 INFO L273 TraceCheckUtils]: 8: Hoare triple {1301#(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; {1301#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,005 INFO L273 TraceCheckUtils]: 7: Hoare triple {1308#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1301#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,005 INFO L273 TraceCheckUtils]: 6: Hoare triple {1308#(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; {1308#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {1123#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);havoc ~a~0;~a~0 := 0bv32; {1308#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,006 INFO L256 TraceCheckUtils]: 4: Hoare triple {1123#true} call #t~ret11 := main(); {1123#true} is VALID [2018-11-23 10:02:36,007 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1123#true} {1123#true} #91#return; {1123#true} is VALID [2018-11-23 10:02:36,007 INFO L273 TraceCheckUtils]: 2: Hoare triple {1123#true} assume true; {1123#true} is VALID [2018-11-23 10:02:36,007 INFO L273 TraceCheckUtils]: 1: Hoare triple {1123#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1123#true} is VALID [2018-11-23 10:02:36,007 INFO L256 TraceCheckUtils]: 0: Hoare triple {1123#true} call ULTIMATE.init(); {1123#true} is VALID [2018-11-23 10:02:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 10:02:36,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:36,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:02:36,018 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-11-23 10:02:36,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:36,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:02:36,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:36,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:02:36,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:02:36,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:02:36,119 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 12 states. [2018-11-23 10:02:37,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:37,022 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2018-11-23 10:02:37,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:02:37,023 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-11-23 10:02:37,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:37,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:02:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 80 transitions. [2018-11-23 10:02:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:02:37,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 80 transitions. [2018-11-23 10:02:37,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 80 transitions. [2018-11-23 10:02:37,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:37,171 INFO L225 Difference]: With dead ends: 73 [2018-11-23 10:02:37,171 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 10:02:37,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:02:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 10:02:37,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-23 10:02:37,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:37,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-23 10:02:37,210 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 10:02:37,210 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 10:02:37,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:37,213 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 10:02:37,213 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 10:02:37,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:37,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:37,214 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 10:02:37,214 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 10:02:37,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:37,217 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 10:02:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 10:02:37,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:37,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:37,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:37,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:37,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 10:02:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-23 10:02:37,221 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 33 [2018-11-23 10:02:37,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:37,222 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-23 10:02:37,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:02:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 10:02:37,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 10:02:37,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:37,223 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] [2018-11-23 10:02:37,224 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:37,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:37,224 INFO L82 PathProgramCache]: Analyzing trace with hash 732981844, now seen corresponding path program 2 times [2018-11-23 10:02:37,225 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:37,225 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:37,254 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:02:37,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:02:37,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:37,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:37,611 INFO L256 TraceCheckUtils]: 0: Hoare triple {1620#true} call ULTIMATE.init(); {1620#true} is VALID [2018-11-23 10:02:37,611 INFO L273 TraceCheckUtils]: 1: Hoare triple {1620#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1620#true} is VALID [2018-11-23 10:02:37,612 INFO L273 TraceCheckUtils]: 2: Hoare triple {1620#true} assume true; {1620#true} is VALID [2018-11-23 10:02:37,612 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1620#true} {1620#true} #91#return; {1620#true} is VALID [2018-11-23 10:02:37,613 INFO L256 TraceCheckUtils]: 4: Hoare triple {1620#true} call #t~ret11 := main(); {1620#true} is VALID [2018-11-23 10:02:37,613 INFO L273 TraceCheckUtils]: 5: Hoare triple {1620#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);havoc ~a~0;~a~0 := 0bv32; {1640#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:37,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {1640#(= 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; {1640#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:37,615 INFO L273 TraceCheckUtils]: 7: Hoare triple {1640#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1647#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:37,616 INFO L273 TraceCheckUtils]: 8: Hoare triple {1647#(= (_ 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; {1647#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:37,616 INFO L273 TraceCheckUtils]: 9: Hoare triple {1647#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1654#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:37,617 INFO L273 TraceCheckUtils]: 10: Hoare triple {1654#(= (_ 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; {1654#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:37,617 INFO L273 TraceCheckUtils]: 11: Hoare triple {1654#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1661#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:37,617 INFO L273 TraceCheckUtils]: 12: Hoare triple {1661#(= (_ 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; {1661#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:37,618 INFO L273 TraceCheckUtils]: 13: Hoare triple {1661#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1668#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:37,619 INFO L273 TraceCheckUtils]: 14: Hoare triple {1668#(= (_ 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; {1668#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:37,621 INFO L273 TraceCheckUtils]: 15: Hoare triple {1668#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1675#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:37,621 INFO L273 TraceCheckUtils]: 16: Hoare triple {1675#(= (_ 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; {1675#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:37,622 INFO L273 TraceCheckUtils]: 17: Hoare triple {1675#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1682#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:37,623 INFO L273 TraceCheckUtils]: 18: Hoare triple {1682#(= (_ 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; {1682#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:37,626 INFO L273 TraceCheckUtils]: 19: Hoare triple {1682#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1689#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:37,627 INFO L273 TraceCheckUtils]: 20: Hoare triple {1689#(= (_ 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; {1689#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:37,627 INFO L273 TraceCheckUtils]: 21: Hoare triple {1689#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1696#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:37,628 INFO L273 TraceCheckUtils]: 22: Hoare triple {1696#(= (_ 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; {1696#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:37,628 INFO L273 TraceCheckUtils]: 23: Hoare triple {1696#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1703#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:37,629 INFO L273 TraceCheckUtils]: 24: Hoare triple {1703#(= (_ 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; {1703#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:37,629 INFO L273 TraceCheckUtils]: 25: Hoare triple {1703#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1710#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 10:02:37,630 INFO L273 TraceCheckUtils]: 26: Hoare triple {1710#(= (_ bv10 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1621#false} is VALID [2018-11-23 10:02:37,630 INFO L273 TraceCheckUtils]: 27: Hoare triple {1621#false} havoc ~i~0;~i~0 := 0bv32; {1621#false} is VALID [2018-11-23 10:02:37,630 INFO L273 TraceCheckUtils]: 28: Hoare triple {1621#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; {1621#false} is VALID [2018-11-23 10:02:37,630 INFO L273 TraceCheckUtils]: 29: Hoare triple {1621#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1621#false} is VALID [2018-11-23 10:02:37,631 INFO L273 TraceCheckUtils]: 30: Hoare triple {1621#false} assume !~bvslt32(~i~0, 100000bv32); {1621#false} is VALID [2018-11-23 10:02:37,631 INFO L273 TraceCheckUtils]: 31: Hoare triple {1621#false} ~i~0 := 0bv32; {1621#false} is VALID [2018-11-23 10:02:37,631 INFO L273 TraceCheckUtils]: 32: Hoare triple {1621#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; {1621#false} is VALID [2018-11-23 10:02:37,632 INFO L273 TraceCheckUtils]: 33: Hoare triple {1621#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1621#false} is VALID [2018-11-23 10:02:37,632 INFO L273 TraceCheckUtils]: 34: Hoare triple {1621#false} assume !~bvslt32(~i~0, 100000bv32); {1621#false} is VALID [2018-11-23 10:02:37,632 INFO L273 TraceCheckUtils]: 35: Hoare triple {1621#false} ~i~0 := 0bv32; {1621#false} is VALID [2018-11-23 10:02:37,633 INFO L273 TraceCheckUtils]: 36: Hoare triple {1621#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; {1621#false} is VALID [2018-11-23 10:02:37,633 INFO L273 TraceCheckUtils]: 37: Hoare triple {1621#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1621#false} is VALID [2018-11-23 10:02:37,634 INFO L273 TraceCheckUtils]: 38: Hoare triple {1621#false} assume !~bvslt32(~i~0, 100000bv32); {1621#false} is VALID [2018-11-23 10:02:37,634 INFO L273 TraceCheckUtils]: 39: Hoare triple {1621#false} havoc ~x~0;~x~0 := 0bv32; {1621#false} is VALID [2018-11-23 10:02:37,634 INFO L273 TraceCheckUtils]: 40: Hoare triple {1621#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1621#false} is VALID [2018-11-23 10:02:37,634 INFO L256 TraceCheckUtils]: 41: Hoare triple {1621#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1bv32 else 0bv32)); {1621#false} is VALID [2018-11-23 10:02:37,635 INFO L273 TraceCheckUtils]: 42: Hoare triple {1621#false} ~cond := #in~cond; {1621#false} is VALID [2018-11-23 10:02:37,635 INFO L273 TraceCheckUtils]: 43: Hoare triple {1621#false} assume 0bv32 == ~cond; {1621#false} is VALID [2018-11-23 10:02:37,635 INFO L273 TraceCheckUtils]: 44: Hoare triple {1621#false} assume !false; {1621#false} is VALID [2018-11-23 10:02:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 10:02:37,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:38,357 INFO L273 TraceCheckUtils]: 44: Hoare triple {1621#false} assume !false; {1621#false} is VALID [2018-11-23 10:02:38,357 INFO L273 TraceCheckUtils]: 43: Hoare triple {1621#false} assume 0bv32 == ~cond; {1621#false} is VALID [2018-11-23 10:02:38,358 INFO L273 TraceCheckUtils]: 42: Hoare triple {1621#false} ~cond := #in~cond; {1621#false} is VALID [2018-11-23 10:02:38,358 INFO L256 TraceCheckUtils]: 41: Hoare triple {1621#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1bv32 else 0bv32)); {1621#false} is VALID [2018-11-23 10:02:38,359 INFO L273 TraceCheckUtils]: 40: Hoare triple {1621#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1621#false} is VALID [2018-11-23 10:02:38,359 INFO L273 TraceCheckUtils]: 39: Hoare triple {1621#false} havoc ~x~0;~x~0 := 0bv32; {1621#false} is VALID [2018-11-23 10:02:38,359 INFO L273 TraceCheckUtils]: 38: Hoare triple {1621#false} assume !~bvslt32(~i~0, 100000bv32); {1621#false} is VALID [2018-11-23 10:02:38,360 INFO L273 TraceCheckUtils]: 37: Hoare triple {1621#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1621#false} is VALID [2018-11-23 10:02:38,360 INFO L273 TraceCheckUtils]: 36: Hoare triple {1621#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; {1621#false} is VALID [2018-11-23 10:02:38,360 INFO L273 TraceCheckUtils]: 35: Hoare triple {1621#false} ~i~0 := 0bv32; {1621#false} is VALID [2018-11-23 10:02:38,361 INFO L273 TraceCheckUtils]: 34: Hoare triple {1621#false} assume !~bvslt32(~i~0, 100000bv32); {1621#false} is VALID [2018-11-23 10:02:38,361 INFO L273 TraceCheckUtils]: 33: Hoare triple {1621#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1621#false} is VALID [2018-11-23 10:02:38,361 INFO L273 TraceCheckUtils]: 32: Hoare triple {1621#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; {1621#false} is VALID [2018-11-23 10:02:38,361 INFO L273 TraceCheckUtils]: 31: Hoare triple {1621#false} ~i~0 := 0bv32; {1621#false} is VALID [2018-11-23 10:02:38,362 INFO L273 TraceCheckUtils]: 30: Hoare triple {1621#false} assume !~bvslt32(~i~0, 100000bv32); {1621#false} is VALID [2018-11-23 10:02:38,362 INFO L273 TraceCheckUtils]: 29: Hoare triple {1621#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1621#false} is VALID [2018-11-23 10:02:38,362 INFO L273 TraceCheckUtils]: 28: Hoare triple {1621#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; {1621#false} is VALID [2018-11-23 10:02:38,362 INFO L273 TraceCheckUtils]: 27: Hoare triple {1621#false} havoc ~i~0;~i~0 := 0bv32; {1621#false} is VALID [2018-11-23 10:02:38,363 INFO L273 TraceCheckUtils]: 26: Hoare triple {1822#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1621#false} is VALID [2018-11-23 10:02:38,364 INFO L273 TraceCheckUtils]: 25: Hoare triple {1826#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1822#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:38,364 INFO L273 TraceCheckUtils]: 24: Hoare triple {1826#(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; {1826#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,369 INFO L273 TraceCheckUtils]: 23: Hoare triple {1833#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1826#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,369 INFO L273 TraceCheckUtils]: 22: Hoare triple {1833#(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; {1833#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,373 INFO L273 TraceCheckUtils]: 21: Hoare triple {1840#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1833#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,374 INFO L273 TraceCheckUtils]: 20: Hoare triple {1840#(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; {1840#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,378 INFO L273 TraceCheckUtils]: 19: Hoare triple {1847#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1840#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,387 INFO L273 TraceCheckUtils]: 18: Hoare triple {1847#(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; {1847#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,394 INFO L273 TraceCheckUtils]: 17: Hoare triple {1854#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1847#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {1854#(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; {1854#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,398 INFO L273 TraceCheckUtils]: 15: Hoare triple {1861#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1854#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,399 INFO L273 TraceCheckUtils]: 14: Hoare triple {1861#(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; {1861#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {1868#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1861#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,406 INFO L273 TraceCheckUtils]: 12: Hoare triple {1868#(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; {1868#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,413 INFO L273 TraceCheckUtils]: 11: Hoare triple {1875#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1868#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,413 INFO L273 TraceCheckUtils]: 10: Hoare triple {1875#(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; {1875#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,420 INFO L273 TraceCheckUtils]: 9: Hoare triple {1882#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1875#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,422 INFO L273 TraceCheckUtils]: 8: Hoare triple {1882#(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; {1882#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,432 INFO L273 TraceCheckUtils]: 7: Hoare triple {1889#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1882#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,433 INFO L273 TraceCheckUtils]: 6: Hoare triple {1889#(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; {1889#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,434 INFO L273 TraceCheckUtils]: 5: Hoare triple {1620#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);havoc ~a~0;~a~0 := 0bv32; {1889#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,435 INFO L256 TraceCheckUtils]: 4: Hoare triple {1620#true} call #t~ret11 := main(); {1620#true} is VALID [2018-11-23 10:02:38,435 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1620#true} {1620#true} #91#return; {1620#true} is VALID [2018-11-23 10:02:38,435 INFO L273 TraceCheckUtils]: 2: Hoare triple {1620#true} assume true; {1620#true} is VALID [2018-11-23 10:02:38,435 INFO L273 TraceCheckUtils]: 1: Hoare triple {1620#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1620#true} is VALID [2018-11-23 10:02:38,436 INFO L256 TraceCheckUtils]: 0: Hoare triple {1620#true} call ULTIMATE.init(); {1620#true} is VALID [2018-11-23 10:02:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 10:02:38,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:38,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:02:38,443 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-11-23 10:02:38,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:38,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:02:38,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:38,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:02:38,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:02:38,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:02:38,660 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 24 states. [2018-11-23 10:02:42,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:42,391 INFO L93 Difference]: Finished difference Result 97 states and 116 transitions. [2018-11-23 10:02:42,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:02:42,392 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-11-23 10:02:42,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:42,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:02:42,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 110 transitions. [2018-11-23 10:02:42,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:02:42,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 110 transitions. [2018-11-23 10:02:42,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 110 transitions. [2018-11-23 10:02:42,597 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:42,598 INFO L225 Difference]: With dead ends: 97 [2018-11-23 10:02:42,599 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 10:02:42,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:02:42,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 10:02:42,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-23 10:02:42,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:42,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2018-11-23 10:02:42,653 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-23 10:02:42,653 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-23 10:02:42,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:42,655 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-11-23 10:02:42,655 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-11-23 10:02:42,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:42,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:42,656 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-23 10:02:42,656 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-23 10:02:42,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:42,659 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-11-23 10:02:42,659 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-11-23 10:02:42,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:42,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:42,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:42,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:42,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 10:02:42,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-11-23 10:02:42,663 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 45 [2018-11-23 10:02:42,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:42,663 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-11-23 10:02:42,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:02:42,663 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-11-23 10:02:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 10:02:42,665 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:42,665 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] [2018-11-23 10:02:42,665 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:42,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:42,666 INFO L82 PathProgramCache]: Analyzing trace with hash 956234428, now seen corresponding path program 3 times [2018-11-23 10:02:42,666 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:42,666 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:42,688 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:02:42,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 10:02:42,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:42,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:42,877 INFO L256 TraceCheckUtils]: 0: Hoare triple {2333#true} call ULTIMATE.init(); {2333#true} is VALID [2018-11-23 10:02:42,878 INFO L273 TraceCheckUtils]: 1: Hoare triple {2333#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2333#true} is VALID [2018-11-23 10:02:42,878 INFO L273 TraceCheckUtils]: 2: Hoare triple {2333#true} assume true; {2333#true} is VALID [2018-11-23 10:02:42,878 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2333#true} {2333#true} #91#return; {2333#true} is VALID [2018-11-23 10:02:42,879 INFO L256 TraceCheckUtils]: 4: Hoare triple {2333#true} call #t~ret11 := main(); {2333#true} is VALID [2018-11-23 10:02:42,879 INFO L273 TraceCheckUtils]: 5: Hoare triple {2333#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);havoc ~a~0;~a~0 := 0bv32; {2333#true} is VALID [2018-11-23 10:02:42,879 INFO L273 TraceCheckUtils]: 6: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:42,879 INFO L273 TraceCheckUtils]: 7: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:42,880 INFO L273 TraceCheckUtils]: 8: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:42,880 INFO L273 TraceCheckUtils]: 9: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:42,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:42,880 INFO L273 TraceCheckUtils]: 11: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:42,880 INFO L273 TraceCheckUtils]: 12: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:42,881 INFO L273 TraceCheckUtils]: 13: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:42,881 INFO L273 TraceCheckUtils]: 14: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:42,881 INFO L273 TraceCheckUtils]: 15: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:42,881 INFO L273 TraceCheckUtils]: 16: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:42,881 INFO L273 TraceCheckUtils]: 17: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:42,881 INFO L273 TraceCheckUtils]: 18: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:42,881 INFO L273 TraceCheckUtils]: 19: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:42,882 INFO L273 TraceCheckUtils]: 20: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:42,882 INFO L273 TraceCheckUtils]: 21: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:42,882 INFO L273 TraceCheckUtils]: 22: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:42,882 INFO L273 TraceCheckUtils]: 23: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:42,882 INFO L273 TraceCheckUtils]: 24: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:42,882 INFO L273 TraceCheckUtils]: 25: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:42,882 INFO L273 TraceCheckUtils]: 26: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:42,883 INFO L273 TraceCheckUtils]: 27: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:42,883 INFO L273 TraceCheckUtils]: 28: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:42,883 INFO L273 TraceCheckUtils]: 29: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:42,883 INFO L273 TraceCheckUtils]: 30: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:42,883 INFO L273 TraceCheckUtils]: 31: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:42,883 INFO L273 TraceCheckUtils]: 32: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:42,884 INFO L273 TraceCheckUtils]: 33: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:42,884 INFO L273 TraceCheckUtils]: 34: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:42,884 INFO L273 TraceCheckUtils]: 35: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:42,884 INFO L273 TraceCheckUtils]: 36: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:42,884 INFO L273 TraceCheckUtils]: 37: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:42,885 INFO L273 TraceCheckUtils]: 38: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:42,885 INFO L273 TraceCheckUtils]: 39: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:42,885 INFO L273 TraceCheckUtils]: 40: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:42,885 INFO L273 TraceCheckUtils]: 41: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:42,885 INFO L273 TraceCheckUtils]: 42: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:42,885 INFO L273 TraceCheckUtils]: 43: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:42,886 INFO L273 TraceCheckUtils]: 44: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:42,886 INFO L273 TraceCheckUtils]: 45: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:42,886 INFO L273 TraceCheckUtils]: 46: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:42,886 INFO L273 TraceCheckUtils]: 47: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:42,886 INFO L273 TraceCheckUtils]: 48: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:42,886 INFO L273 TraceCheckUtils]: 49: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:42,887 INFO L273 TraceCheckUtils]: 50: Hoare triple {2333#true} assume !~bvslt32(~a~0, 100000bv32); {2333#true} is VALID [2018-11-23 10:02:42,887 INFO L273 TraceCheckUtils]: 51: Hoare triple {2333#true} havoc ~i~0;~i~0 := 0bv32; {2491#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:42,888 INFO L273 TraceCheckUtils]: 52: Hoare triple {2491#(= main_~i~0 (_ bv0 32))} 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; {2491#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:42,888 INFO L273 TraceCheckUtils]: 53: Hoare triple {2491#(= main_~i~0 (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2498#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:42,888 INFO L273 TraceCheckUtils]: 54: Hoare triple {2498#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {2334#false} is VALID [2018-11-23 10:02:42,889 INFO L273 TraceCheckUtils]: 55: Hoare triple {2334#false} ~i~0 := 0bv32; {2334#false} is VALID [2018-11-23 10:02:42,889 INFO L273 TraceCheckUtils]: 56: Hoare triple {2334#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; {2334#false} is VALID [2018-11-23 10:02:42,889 INFO L273 TraceCheckUtils]: 57: Hoare triple {2334#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2334#false} is VALID [2018-11-23 10:02:42,889 INFO L273 TraceCheckUtils]: 58: Hoare triple {2334#false} assume !~bvslt32(~i~0, 100000bv32); {2334#false} is VALID [2018-11-23 10:02:42,889 INFO L273 TraceCheckUtils]: 59: Hoare triple {2334#false} ~i~0 := 0bv32; {2334#false} is VALID [2018-11-23 10:02:42,889 INFO L273 TraceCheckUtils]: 60: Hoare triple {2334#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; {2334#false} is VALID [2018-11-23 10:02:42,890 INFO L273 TraceCheckUtils]: 61: Hoare triple {2334#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2334#false} is VALID [2018-11-23 10:02:42,890 INFO L273 TraceCheckUtils]: 62: Hoare triple {2334#false} assume !~bvslt32(~i~0, 100000bv32); {2334#false} is VALID [2018-11-23 10:02:42,890 INFO L273 TraceCheckUtils]: 63: Hoare triple {2334#false} havoc ~x~0;~x~0 := 0bv32; {2334#false} is VALID [2018-11-23 10:02:42,890 INFO L273 TraceCheckUtils]: 64: Hoare triple {2334#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2334#false} is VALID [2018-11-23 10:02:42,890 INFO L256 TraceCheckUtils]: 65: Hoare triple {2334#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1bv32 else 0bv32)); {2334#false} is VALID [2018-11-23 10:02:42,890 INFO L273 TraceCheckUtils]: 66: Hoare triple {2334#false} ~cond := #in~cond; {2334#false} is VALID [2018-11-23 10:02:42,890 INFO L273 TraceCheckUtils]: 67: Hoare triple {2334#false} assume 0bv32 == ~cond; {2334#false} is VALID [2018-11-23 10:02:42,891 INFO L273 TraceCheckUtils]: 68: Hoare triple {2334#false} assume !false; {2334#false} is VALID [2018-11-23 10:02:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2018-11-23 10:02:42,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:43,000 INFO L273 TraceCheckUtils]: 68: Hoare triple {2334#false} assume !false; {2334#false} is VALID [2018-11-23 10:02:43,000 INFO L273 TraceCheckUtils]: 67: Hoare triple {2334#false} assume 0bv32 == ~cond; {2334#false} is VALID [2018-11-23 10:02:43,000 INFO L273 TraceCheckUtils]: 66: Hoare triple {2334#false} ~cond := #in~cond; {2334#false} is VALID [2018-11-23 10:02:43,001 INFO L256 TraceCheckUtils]: 65: Hoare triple {2334#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1bv32 else 0bv32)); {2334#false} is VALID [2018-11-23 10:02:43,001 INFO L273 TraceCheckUtils]: 64: Hoare triple {2334#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2334#false} is VALID [2018-11-23 10:02:43,001 INFO L273 TraceCheckUtils]: 63: Hoare triple {2334#false} havoc ~x~0;~x~0 := 0bv32; {2334#false} is VALID [2018-11-23 10:02:43,002 INFO L273 TraceCheckUtils]: 62: Hoare triple {2334#false} assume !~bvslt32(~i~0, 100000bv32); {2334#false} is VALID [2018-11-23 10:02:43,002 INFO L273 TraceCheckUtils]: 61: Hoare triple {2334#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2334#false} is VALID [2018-11-23 10:02:43,002 INFO L273 TraceCheckUtils]: 60: Hoare triple {2334#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; {2334#false} is VALID [2018-11-23 10:02:43,003 INFO L273 TraceCheckUtils]: 59: Hoare triple {2334#false} ~i~0 := 0bv32; {2334#false} is VALID [2018-11-23 10:02:43,003 INFO L273 TraceCheckUtils]: 58: Hoare triple {2334#false} assume !~bvslt32(~i~0, 100000bv32); {2334#false} is VALID [2018-11-23 10:02:43,003 INFO L273 TraceCheckUtils]: 57: Hoare triple {2334#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2334#false} is VALID [2018-11-23 10:02:43,003 INFO L273 TraceCheckUtils]: 56: Hoare triple {2334#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; {2334#false} is VALID [2018-11-23 10:02:43,003 INFO L273 TraceCheckUtils]: 55: Hoare triple {2334#false} ~i~0 := 0bv32; {2334#false} is VALID [2018-11-23 10:02:43,010 INFO L273 TraceCheckUtils]: 54: Hoare triple {2586#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2334#false} is VALID [2018-11-23 10:02:43,010 INFO L273 TraceCheckUtils]: 53: Hoare triple {2590#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2586#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:43,011 INFO L273 TraceCheckUtils]: 52: Hoare triple {2590#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} 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; {2590#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,018 INFO L273 TraceCheckUtils]: 51: Hoare triple {2333#true} havoc ~i~0;~i~0 := 0bv32; {2590#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:43,018 INFO L273 TraceCheckUtils]: 50: Hoare triple {2333#true} assume !~bvslt32(~a~0, 100000bv32); {2333#true} is VALID [2018-11-23 10:02:43,018 INFO L273 TraceCheckUtils]: 49: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:43,018 INFO L273 TraceCheckUtils]: 48: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:43,019 INFO L273 TraceCheckUtils]: 47: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:43,019 INFO L273 TraceCheckUtils]: 46: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:43,019 INFO L273 TraceCheckUtils]: 45: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:43,019 INFO L273 TraceCheckUtils]: 44: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:43,020 INFO L273 TraceCheckUtils]: 43: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:43,020 INFO L273 TraceCheckUtils]: 42: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:43,020 INFO L273 TraceCheckUtils]: 41: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:43,020 INFO L273 TraceCheckUtils]: 40: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:43,020 INFO L273 TraceCheckUtils]: 39: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:43,021 INFO L273 TraceCheckUtils]: 38: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:43,021 INFO L273 TraceCheckUtils]: 37: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:43,021 INFO L273 TraceCheckUtils]: 36: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:43,021 INFO L273 TraceCheckUtils]: 35: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:43,021 INFO L273 TraceCheckUtils]: 34: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:43,022 INFO L273 TraceCheckUtils]: 33: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:43,022 INFO L273 TraceCheckUtils]: 32: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:43,022 INFO L273 TraceCheckUtils]: 31: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:43,022 INFO L273 TraceCheckUtils]: 30: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:43,022 INFO L273 TraceCheckUtils]: 29: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:43,023 INFO L273 TraceCheckUtils]: 28: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:43,023 INFO L273 TraceCheckUtils]: 27: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:43,023 INFO L273 TraceCheckUtils]: 26: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:43,023 INFO L273 TraceCheckUtils]: 25: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:43,023 INFO L273 TraceCheckUtils]: 24: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:43,024 INFO L273 TraceCheckUtils]: 23: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:43,024 INFO L273 TraceCheckUtils]: 22: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:43,024 INFO L273 TraceCheckUtils]: 21: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:43,024 INFO L273 TraceCheckUtils]: 20: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:43,024 INFO L273 TraceCheckUtils]: 19: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:43,025 INFO L273 TraceCheckUtils]: 18: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:43,025 INFO L273 TraceCheckUtils]: 17: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:43,025 INFO L273 TraceCheckUtils]: 16: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:43,025 INFO L273 TraceCheckUtils]: 15: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:43,025 INFO L273 TraceCheckUtils]: 14: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:43,026 INFO L273 TraceCheckUtils]: 13: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:43,026 INFO L273 TraceCheckUtils]: 12: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:43,026 INFO L273 TraceCheckUtils]: 11: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:43,026 INFO L273 TraceCheckUtils]: 10: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:43,026 INFO L273 TraceCheckUtils]: 9: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:43,027 INFO L273 TraceCheckUtils]: 8: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:43,027 INFO L273 TraceCheckUtils]: 7: Hoare triple {2333#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#true} is VALID [2018-11-23 10:02:43,027 INFO L273 TraceCheckUtils]: 6: Hoare triple {2333#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; {2333#true} is VALID [2018-11-23 10:02:43,027 INFO L273 TraceCheckUtils]: 5: Hoare triple {2333#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);havoc ~a~0;~a~0 := 0bv32; {2333#true} is VALID [2018-11-23 10:02:43,027 INFO L256 TraceCheckUtils]: 4: Hoare triple {2333#true} call #t~ret11 := main(); {2333#true} is VALID [2018-11-23 10:02:43,028 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2333#true} {2333#true} #91#return; {2333#true} is VALID [2018-11-23 10:02:43,028 INFO L273 TraceCheckUtils]: 2: Hoare triple {2333#true} assume true; {2333#true} is VALID [2018-11-23 10:02:43,028 INFO L273 TraceCheckUtils]: 1: Hoare triple {2333#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2333#true} is VALID [2018-11-23 10:02:43,028 INFO L256 TraceCheckUtils]: 0: Hoare triple {2333#true} call ULTIMATE.init(); {2333#true} is VALID [2018-11-23 10:02:43,031 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2018-11-23 10:02:43,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:43,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:02:43,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-23 10:02:43,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:43,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:02:43,107 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:43,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:02:43,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:02:43,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:02:43,109 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 6 states. [2018-11-23 10:02:43,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:43,517 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2018-11-23 10:02:43,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:02:43,518 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-23 10:02:43,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:43,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 10:02:43,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 10:02:43,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 81 transitions. [2018-11-23 10:02:43,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:43,692 INFO L225 Difference]: With dead ends: 111 [2018-11-23 10:02:43,692 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 10:02:43,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 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:43,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 10:02:43,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-23 10:02:43,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:43,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 92 states. [2018-11-23 10:02:43,931 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-23 10:02:43,931 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-23 10:02:43,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:43,934 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-11-23 10:02:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-23 10:02:43,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:43,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:43,935 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-23 10:02:43,935 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-23 10:02:43,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:43,938 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-11-23 10:02:43,938 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-23 10:02:43,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:43,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:43,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:43,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:43,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 10:02:43,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-11-23 10:02:43,942 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 69 [2018-11-23 10:02:43,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:43,942 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-11-23 10:02:43,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:02:43,943 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-23 10:02:43,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 10:02:43,944 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:43,944 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 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] [2018-11-23 10:02:43,944 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:43,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:43,944 INFO L82 PathProgramCache]: Analyzing trace with hash 109795786, now seen corresponding path program 4 times [2018-11-23 10:02:43,945 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:43,945 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:43,967 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:02:44,090 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:02:44,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:44,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:45,018 INFO L256 TraceCheckUtils]: 0: Hoare triple {3238#true} call ULTIMATE.init(); {3238#true} is VALID [2018-11-23 10:02:45,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {3238#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3238#true} is VALID [2018-11-23 10:02:45,019 INFO L273 TraceCheckUtils]: 2: Hoare triple {3238#true} assume true; {3238#true} is VALID [2018-11-23 10:02:45,019 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3238#true} {3238#true} #91#return; {3238#true} is VALID [2018-11-23 10:02:45,020 INFO L256 TraceCheckUtils]: 4: Hoare triple {3238#true} call #t~ret11 := main(); {3238#true} is VALID [2018-11-23 10:02:45,020 INFO L273 TraceCheckUtils]: 5: Hoare triple {3238#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);havoc ~a~0;~a~0 := 0bv32; {3258#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:45,021 INFO L273 TraceCheckUtils]: 6: Hoare triple {3258#(= 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; {3258#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:45,021 INFO L273 TraceCheckUtils]: 7: Hoare triple {3258#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3265#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:45,021 INFO L273 TraceCheckUtils]: 8: Hoare triple {3265#(= (_ 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; {3265#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:45,022 INFO L273 TraceCheckUtils]: 9: Hoare triple {3265#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3272#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:45,022 INFO L273 TraceCheckUtils]: 10: Hoare triple {3272#(= (_ 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; {3272#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:45,023 INFO L273 TraceCheckUtils]: 11: Hoare triple {3272#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3279#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:45,023 INFO L273 TraceCheckUtils]: 12: Hoare triple {3279#(= (_ 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; {3279#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:45,024 INFO L273 TraceCheckUtils]: 13: Hoare triple {3279#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3286#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:45,025 INFO L273 TraceCheckUtils]: 14: Hoare triple {3286#(= (_ 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; {3286#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:45,025 INFO L273 TraceCheckUtils]: 15: Hoare triple {3286#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3293#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:45,026 INFO L273 TraceCheckUtils]: 16: Hoare triple {3293#(= (_ 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; {3293#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:45,026 INFO L273 TraceCheckUtils]: 17: Hoare triple {3293#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3300#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:45,027 INFO L273 TraceCheckUtils]: 18: Hoare triple {3300#(= (_ 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; {3300#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:45,028 INFO L273 TraceCheckUtils]: 19: Hoare triple {3300#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3307#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:45,028 INFO L273 TraceCheckUtils]: 20: Hoare triple {3307#(= (_ 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; {3307#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:45,029 INFO L273 TraceCheckUtils]: 21: Hoare triple {3307#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3314#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:45,030 INFO L273 TraceCheckUtils]: 22: Hoare triple {3314#(= (_ 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; {3314#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:45,030 INFO L273 TraceCheckUtils]: 23: Hoare triple {3314#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3321#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:45,031 INFO L273 TraceCheckUtils]: 24: Hoare triple {3321#(= (_ 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; {3321#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:45,031 INFO L273 TraceCheckUtils]: 25: Hoare triple {3321#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3328#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 10:02:45,032 INFO L273 TraceCheckUtils]: 26: Hoare triple {3328#(= (_ 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; {3328#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 10:02:45,033 INFO L273 TraceCheckUtils]: 27: Hoare triple {3328#(= (_ bv10 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3335#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-23 10:02:45,033 INFO L273 TraceCheckUtils]: 28: Hoare triple {3335#(= (_ 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; {3335#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-23 10:02:45,034 INFO L273 TraceCheckUtils]: 29: Hoare triple {3335#(= (_ bv11 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3342#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-23 10:02:45,035 INFO L273 TraceCheckUtils]: 30: Hoare triple {3342#(= (_ 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; {3342#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-23 10:02:45,035 INFO L273 TraceCheckUtils]: 31: Hoare triple {3342#(= (_ bv12 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3349#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-23 10:02:45,036 INFO L273 TraceCheckUtils]: 32: Hoare triple {3349#(= (_ 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; {3349#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-23 10:02:45,036 INFO L273 TraceCheckUtils]: 33: Hoare triple {3349#(= (_ bv13 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3356#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-23 10:02:45,037 INFO L273 TraceCheckUtils]: 34: Hoare triple {3356#(= (_ 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; {3356#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-23 10:02:45,037 INFO L273 TraceCheckUtils]: 35: Hoare triple {3356#(= (_ bv14 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3363#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-23 10:02:45,038 INFO L273 TraceCheckUtils]: 36: Hoare triple {3363#(= (_ 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; {3363#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-23 10:02:45,039 INFO L273 TraceCheckUtils]: 37: Hoare triple {3363#(= (_ bv15 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3370#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-23 10:02:45,039 INFO L273 TraceCheckUtils]: 38: Hoare triple {3370#(= (_ 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; {3370#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-23 10:02:45,040 INFO L273 TraceCheckUtils]: 39: Hoare triple {3370#(= (_ bv16 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3377#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-23 10:02:45,040 INFO L273 TraceCheckUtils]: 40: Hoare triple {3377#(= (_ 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; {3377#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-23 10:02:45,041 INFO L273 TraceCheckUtils]: 41: Hoare triple {3377#(= (_ bv17 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3384#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-23 10:02:45,041 INFO L273 TraceCheckUtils]: 42: Hoare triple {3384#(= (_ 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; {3384#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-23 10:02:45,042 INFO L273 TraceCheckUtils]: 43: Hoare triple {3384#(= (_ bv18 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3391#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-23 10:02:45,043 INFO L273 TraceCheckUtils]: 44: Hoare triple {3391#(= (_ 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; {3391#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-23 10:02:45,043 INFO L273 TraceCheckUtils]: 45: Hoare triple {3391#(= (_ bv19 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3398#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-23 10:02:45,044 INFO L273 TraceCheckUtils]: 46: Hoare triple {3398#(= (_ 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; {3398#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-23 10:02:45,044 INFO L273 TraceCheckUtils]: 47: Hoare triple {3398#(= (_ bv20 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-23 10:02:45,045 INFO L273 TraceCheckUtils]: 48: Hoare triple {3405#(= (_ 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; {3405#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-23 10:02:45,046 INFO L273 TraceCheckUtils]: 49: Hoare triple {3405#(= (_ bv21 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3412#(= (_ bv22 32) main_~a~0)} is VALID [2018-11-23 10:02:45,046 INFO L273 TraceCheckUtils]: 50: Hoare triple {3412#(= (_ bv22 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {3239#false} is VALID [2018-11-23 10:02:45,047 INFO L273 TraceCheckUtils]: 51: Hoare triple {3239#false} havoc ~i~0;~i~0 := 0bv32; {3239#false} is VALID [2018-11-23 10:02:45,047 INFO L273 TraceCheckUtils]: 52: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:45,047 INFO L273 TraceCheckUtils]: 53: Hoare triple {3239#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3239#false} is VALID [2018-11-23 10:02:45,047 INFO L273 TraceCheckUtils]: 54: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:45,048 INFO L273 TraceCheckUtils]: 55: Hoare triple {3239#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3239#false} is VALID [2018-11-23 10:02:45,048 INFO L273 TraceCheckUtils]: 56: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:45,048 INFO L273 TraceCheckUtils]: 57: Hoare triple {3239#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3239#false} is VALID [2018-11-23 10:02:45,049 INFO L273 TraceCheckUtils]: 58: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:45,049 INFO L273 TraceCheckUtils]: 59: Hoare triple {3239#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3239#false} is VALID [2018-11-23 10:02:45,049 INFO L273 TraceCheckUtils]: 60: Hoare triple {3239#false} assume !~bvslt32(~i~0, 100000bv32); {3239#false} is VALID [2018-11-23 10:02:45,049 INFO L273 TraceCheckUtils]: 61: Hoare triple {3239#false} ~i~0 := 0bv32; {3239#false} is VALID [2018-11-23 10:02:45,050 INFO L273 TraceCheckUtils]: 62: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:45,050 INFO L273 TraceCheckUtils]: 63: Hoare triple {3239#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3239#false} is VALID [2018-11-23 10:02:45,050 INFO L273 TraceCheckUtils]: 64: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:45,050 INFO L273 TraceCheckUtils]: 65: Hoare triple {3239#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3239#false} is VALID [2018-11-23 10:02:45,050 INFO L273 TraceCheckUtils]: 66: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:45,051 INFO L273 TraceCheckUtils]: 67: Hoare triple {3239#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3239#false} is VALID [2018-11-23 10:02:45,051 INFO L273 TraceCheckUtils]: 68: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:45,051 INFO L273 TraceCheckUtils]: 69: Hoare triple {3239#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3239#false} is VALID [2018-11-23 10:02:45,051 INFO L273 TraceCheckUtils]: 70: Hoare triple {3239#false} assume !~bvslt32(~i~0, 100000bv32); {3239#false} is VALID [2018-11-23 10:02:45,051 INFO L273 TraceCheckUtils]: 71: Hoare triple {3239#false} ~i~0 := 0bv32; {3239#false} is VALID [2018-11-23 10:02:45,052 INFO L273 TraceCheckUtils]: 72: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:45,052 INFO L273 TraceCheckUtils]: 73: Hoare triple {3239#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3239#false} is VALID [2018-11-23 10:02:45,052 INFO L273 TraceCheckUtils]: 74: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:45,052 INFO L273 TraceCheckUtils]: 75: Hoare triple {3239#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3239#false} is VALID [2018-11-23 10:02:45,052 INFO L273 TraceCheckUtils]: 76: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:45,052 INFO L273 TraceCheckUtils]: 77: Hoare triple {3239#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3239#false} is VALID [2018-11-23 10:02:45,053 INFO L273 TraceCheckUtils]: 78: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:45,053 INFO L273 TraceCheckUtils]: 79: Hoare triple {3239#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3239#false} is VALID [2018-11-23 10:02:45,053 INFO L273 TraceCheckUtils]: 80: Hoare triple {3239#false} assume !~bvslt32(~i~0, 100000bv32); {3239#false} is VALID [2018-11-23 10:02:45,053 INFO L273 TraceCheckUtils]: 81: Hoare triple {3239#false} havoc ~x~0;~x~0 := 0bv32; {3239#false} is VALID [2018-11-23 10:02:45,053 INFO L273 TraceCheckUtils]: 82: Hoare triple {3239#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3239#false} is VALID [2018-11-23 10:02:45,054 INFO L256 TraceCheckUtils]: 83: Hoare triple {3239#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1bv32 else 0bv32)); {3239#false} is VALID [2018-11-23 10:02:45,054 INFO L273 TraceCheckUtils]: 84: Hoare triple {3239#false} ~cond := #in~cond; {3239#false} is VALID [2018-11-23 10:02:45,054 INFO L273 TraceCheckUtils]: 85: Hoare triple {3239#false} assume 0bv32 == ~cond; {3239#false} is VALID [2018-11-23 10:02:45,054 INFO L273 TraceCheckUtils]: 86: Hoare triple {3239#false} assume !false; {3239#false} is VALID [2018-11-23 10:02:45,060 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-23 10:02:45,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:47,186 INFO L273 TraceCheckUtils]: 86: Hoare triple {3239#false} assume !false; {3239#false} is VALID [2018-11-23 10:02:47,187 INFO L273 TraceCheckUtils]: 85: Hoare triple {3239#false} assume 0bv32 == ~cond; {3239#false} is VALID [2018-11-23 10:02:47,187 INFO L273 TraceCheckUtils]: 84: Hoare triple {3239#false} ~cond := #in~cond; {3239#false} is VALID [2018-11-23 10:02:47,187 INFO L256 TraceCheckUtils]: 83: Hoare triple {3239#false} call __VERIFIER_assert((if #t~mem9 == #t~mem10 then 1bv32 else 0bv32)); {3239#false} is VALID [2018-11-23 10:02:47,187 INFO L273 TraceCheckUtils]: 82: Hoare triple {3239#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3239#false} is VALID [2018-11-23 10:02:47,187 INFO L273 TraceCheckUtils]: 81: Hoare triple {3239#false} havoc ~x~0;~x~0 := 0bv32; {3239#false} is VALID [2018-11-23 10:02:47,188 INFO L273 TraceCheckUtils]: 80: Hoare triple {3239#false} assume !~bvslt32(~i~0, 100000bv32); {3239#false} is VALID [2018-11-23 10:02:47,188 INFO L273 TraceCheckUtils]: 79: Hoare triple {3239#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3239#false} is VALID [2018-11-23 10:02:47,188 INFO L273 TraceCheckUtils]: 78: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:47,188 INFO L273 TraceCheckUtils]: 77: Hoare triple {3239#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3239#false} is VALID [2018-11-23 10:02:47,188 INFO L273 TraceCheckUtils]: 76: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:47,188 INFO L273 TraceCheckUtils]: 75: Hoare triple {3239#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3239#false} is VALID [2018-11-23 10:02:47,188 INFO L273 TraceCheckUtils]: 74: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:47,189 INFO L273 TraceCheckUtils]: 73: Hoare triple {3239#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3239#false} is VALID [2018-11-23 10:02:47,189 INFO L273 TraceCheckUtils]: 72: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:47,189 INFO L273 TraceCheckUtils]: 71: Hoare triple {3239#false} ~i~0 := 0bv32; {3239#false} is VALID [2018-11-23 10:02:47,189 INFO L273 TraceCheckUtils]: 70: Hoare triple {3239#false} assume !~bvslt32(~i~0, 100000bv32); {3239#false} is VALID [2018-11-23 10:02:47,189 INFO L273 TraceCheckUtils]: 69: Hoare triple {3239#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3239#false} is VALID [2018-11-23 10:02:47,189 INFO L273 TraceCheckUtils]: 68: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:47,189 INFO L273 TraceCheckUtils]: 67: Hoare triple {3239#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3239#false} is VALID [2018-11-23 10:02:47,190 INFO L273 TraceCheckUtils]: 66: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:47,190 INFO L273 TraceCheckUtils]: 65: Hoare triple {3239#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3239#false} is VALID [2018-11-23 10:02:47,190 INFO L273 TraceCheckUtils]: 64: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:47,190 INFO L273 TraceCheckUtils]: 63: Hoare triple {3239#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3239#false} is VALID [2018-11-23 10:02:47,190 INFO L273 TraceCheckUtils]: 62: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:47,191 INFO L273 TraceCheckUtils]: 61: Hoare triple {3239#false} ~i~0 := 0bv32; {3239#false} is VALID [2018-11-23 10:02:47,191 INFO L273 TraceCheckUtils]: 60: Hoare triple {3239#false} assume !~bvslt32(~i~0, 100000bv32); {3239#false} is VALID [2018-11-23 10:02:47,191 INFO L273 TraceCheckUtils]: 59: Hoare triple {3239#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3239#false} is VALID [2018-11-23 10:02:47,191 INFO L273 TraceCheckUtils]: 58: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:47,191 INFO L273 TraceCheckUtils]: 57: Hoare triple {3239#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3239#false} is VALID [2018-11-23 10:02:47,191 INFO L273 TraceCheckUtils]: 56: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:47,192 INFO L273 TraceCheckUtils]: 55: Hoare triple {3239#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3239#false} is VALID [2018-11-23 10:02:47,192 INFO L273 TraceCheckUtils]: 54: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:47,192 INFO L273 TraceCheckUtils]: 53: Hoare triple {3239#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3239#false} is VALID [2018-11-23 10:02:47,192 INFO L273 TraceCheckUtils]: 52: Hoare triple {3239#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; {3239#false} is VALID [2018-11-23 10:02:47,192 INFO L273 TraceCheckUtils]: 51: Hoare triple {3239#false} havoc ~i~0;~i~0 := 0bv32; {3239#false} is VALID [2018-11-23 10:02:47,202 INFO L273 TraceCheckUtils]: 50: Hoare triple {3632#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {3239#false} is VALID [2018-11-23 10:02:47,211 INFO L273 TraceCheckUtils]: 49: Hoare triple {3636#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3632#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:47,211 INFO L273 TraceCheckUtils]: 48: Hoare triple {3636#(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; {3636#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,216 INFO L273 TraceCheckUtils]: 47: Hoare triple {3643#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3636#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,216 INFO L273 TraceCheckUtils]: 46: Hoare triple {3643#(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; {3643#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,220 INFO L273 TraceCheckUtils]: 45: Hoare triple {3650#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3643#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,221 INFO L273 TraceCheckUtils]: 44: Hoare triple {3650#(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; {3650#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,225 INFO L273 TraceCheckUtils]: 43: Hoare triple {3657#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3650#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,226 INFO L273 TraceCheckUtils]: 42: Hoare triple {3657#(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; {3657#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,232 INFO L273 TraceCheckUtils]: 41: Hoare triple {3664#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3657#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,236 INFO L273 TraceCheckUtils]: 40: Hoare triple {3664#(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; {3664#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,240 INFO L273 TraceCheckUtils]: 39: Hoare triple {3671#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3664#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,241 INFO L273 TraceCheckUtils]: 38: Hoare triple {3671#(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; {3671#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,246 INFO L273 TraceCheckUtils]: 37: Hoare triple {3678#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3671#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,247 INFO L273 TraceCheckUtils]: 36: Hoare triple {3678#(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; {3678#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,256 INFO L273 TraceCheckUtils]: 35: Hoare triple {3685#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3678#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,256 INFO L273 TraceCheckUtils]: 34: Hoare triple {3685#(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; {3685#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,261 INFO L273 TraceCheckUtils]: 33: Hoare triple {3692#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3685#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,262 INFO L273 TraceCheckUtils]: 32: Hoare triple {3692#(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; {3692#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,268 INFO L273 TraceCheckUtils]: 31: Hoare triple {3699#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3692#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,268 INFO L273 TraceCheckUtils]: 30: Hoare triple {3699#(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; {3699#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,275 INFO L273 TraceCheckUtils]: 29: Hoare triple {3706#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3699#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,276 INFO L273 TraceCheckUtils]: 28: Hoare triple {3706#(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; {3706#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,283 INFO L273 TraceCheckUtils]: 27: Hoare triple {3713#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3706#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,283 INFO L273 TraceCheckUtils]: 26: Hoare triple {3713#(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; {3713#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,292 INFO L273 TraceCheckUtils]: 25: Hoare triple {3720#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3713#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,292 INFO L273 TraceCheckUtils]: 24: Hoare triple {3720#(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; {3720#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,299 INFO L273 TraceCheckUtils]: 23: Hoare triple {3727#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3720#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,300 INFO L273 TraceCheckUtils]: 22: Hoare triple {3727#(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; {3727#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,305 INFO L273 TraceCheckUtils]: 21: Hoare triple {3734#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3727#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,306 INFO L273 TraceCheckUtils]: 20: Hoare triple {3734#(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; {3734#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,312 INFO L273 TraceCheckUtils]: 19: Hoare triple {3741#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3734#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,312 INFO L273 TraceCheckUtils]: 18: Hoare triple {3741#(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; {3741#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,316 INFO L273 TraceCheckUtils]: 17: Hoare triple {3748#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3741#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,317 INFO L273 TraceCheckUtils]: 16: Hoare triple {3748#(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; {3748#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,324 INFO L273 TraceCheckUtils]: 15: Hoare triple {3755#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3748#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,325 INFO L273 TraceCheckUtils]: 14: Hoare triple {3755#(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; {3755#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,331 INFO L273 TraceCheckUtils]: 13: Hoare triple {3762#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3755#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,332 INFO L273 TraceCheckUtils]: 12: Hoare triple {3762#(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; {3762#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,339 INFO L273 TraceCheckUtils]: 11: Hoare triple {3769#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3762#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,339 INFO L273 TraceCheckUtils]: 10: Hoare triple {3769#(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; {3769#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,346 INFO L273 TraceCheckUtils]: 9: Hoare triple {3776#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3769#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,346 INFO L273 TraceCheckUtils]: 8: Hoare triple {3776#(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; {3776#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,355 INFO L273 TraceCheckUtils]: 7: Hoare triple {3783#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,355 INFO L273 TraceCheckUtils]: 6: Hoare triple {3783#(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; {3783#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {3238#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);havoc ~a~0;~a~0 := 0bv32; {3783#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:47,356 INFO L256 TraceCheckUtils]: 4: Hoare triple {3238#true} call #t~ret11 := main(); {3238#true} is VALID [2018-11-23 10:02:47,357 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3238#true} {3238#true} #91#return; {3238#true} is VALID [2018-11-23 10:02:47,357 INFO L273 TraceCheckUtils]: 2: Hoare triple {3238#true} assume true; {3238#true} is VALID [2018-11-23 10:02:47,357 INFO L273 TraceCheckUtils]: 1: Hoare triple {3238#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3238#true} is VALID [2018-11-23 10:02:47,357 INFO L256 TraceCheckUtils]: 0: Hoare triple {3238#true} call ULTIMATE.init(); {3238#true} is VALID [2018-11-23 10:02:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-23 10:02:47,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:47,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:02:47,367 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 87 [2018-11-23 10:02:47,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:47,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:02:47,645 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:47,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:02:47,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:02:47,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:02:47,647 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 48 states. [2018-11-23 10:02:52,416 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:02:52,881 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:02:53,398 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:02:53,918 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:02:54,470 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:02:55,106 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:03:03,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:03,317 INFO L93 Difference]: Finished difference Result 181 states and 212 transitions. [2018-11-23 10:03:03,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:03:03,317 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 87 [2018-11-23 10:03:03,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:03:03,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:03:03,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 170 transitions. [2018-11-23 10:03:03,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:03:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 170 transitions. [2018-11-23 10:03:03,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 170 transitions. [2018-11-23 10:03:03,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:03:03,689 INFO L225 Difference]: With dead ends: 181 [2018-11-23 10:03:03,689 INFO L226 Difference]: Without dead ends: 140 [2018-11-23 10:03:03,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:03:03,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-23 10:03:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-11-23 10:03:03,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:03:03,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand 140 states. [2018-11-23 10:03:03,757 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 140 states. [2018-11-23 10:03:03,757 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 140 states. [2018-11-23 10:03:03,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:03,762 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2018-11-23 10:03:03,762 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-11-23 10:03:03,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:03:03,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:03:03,762 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 140 states. [2018-11-23 10:03:03,762 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 140 states. [2018-11-23 10:03:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:03,766 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2018-11-23 10:03:03,766 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-11-23 10:03:03,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:03:03,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:03:03,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:03:03,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:03:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-23 10:03:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2018-11-23 10:03:03,772 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 87 [2018-11-23 10:03:03,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:03:03,772 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2018-11-23 10:03:03,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:03:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-11-23 10:03:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-23 10:03:03,774 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:03:03,774 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 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] [2018-11-23 10:03:03,775 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:03:03,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:03:03,775 INFO L82 PathProgramCache]: Analyzing trace with hash 557825690, now seen corresponding path program 5 times [2018-11-23 10:03:03,776 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:03:03,776 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:03,800 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1