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_palindrome_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:09:45,201 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:09:45,203 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:09:45,218 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:09:45,219 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:09:45,220 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:09:45,221 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:09:45,223 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:09:45,225 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:09:45,225 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:09:45,226 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:09:45,227 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:09:45,227 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:09:45,228 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:09:45,230 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:09:45,230 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:09:45,231 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:09:45,234 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:09:45,236 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:09:45,237 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:09:45,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:09:45,240 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:09:45,242 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:09:45,243 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:09:45,243 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:09:45,244 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:09:45,245 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:09:45,246 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:09:45,247 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:09:45,252 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:09:45,252 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:09:45,253 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:09:45,254 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:09:45,254 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:09:45,255 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:09:45,256 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:09:45,256 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:09:45,272 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:09:45,273 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:09:45,273 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:09:45,274 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:09:45,274 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:09:45,274 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:09:45,275 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:09:45,275 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:09:45,275 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:09:45,275 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:09:45,275 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:09:45,276 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:09:45,276 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:09:45,276 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:09:45,276 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:09:45,276 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:09:45,277 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:09:45,277 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:09:45,277 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:09:45,277 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:09:45,277 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:09:45,278 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:09:45,278 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:09:45,278 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:09:45,278 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:09:45,278 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:09:45,279 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:09:45,279 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:09:45,279 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:09:45,279 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:09:45,279 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:09:45,279 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:09:45,280 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:09:45,341 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:09:45,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:09:45,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:09:45,364 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:09:45,364 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:09:45,365 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_palindrome_true-unreach-call_ground.i [2018-11-23 10:09:45,424 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a06130c5/dedca0e267ce46f9ad08c0c400b7d1f4/FLAG575c5644a [2018-11-23 10:09:45,901 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:09:45,902 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_palindrome_true-unreach-call_ground.i [2018-11-23 10:09:45,908 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a06130c5/dedca0e267ce46f9ad08c0c400b7d1f4/FLAG575c5644a [2018-11-23 10:09:46,248 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a06130c5/dedca0e267ce46f9ad08c0c400b7d1f4 [2018-11-23 10:09:46,258 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:09:46,260 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:09:46,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:09:46,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:09:46,268 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:09:46,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:09:46" (1/1) ... [2018-11-23 10:09:46,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f821127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:46, skipping insertion in model container [2018-11-23 10:09:46,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:09:46" (1/1) ... [2018-11-23 10:09:46,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:09:46,313 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:09:46,571 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:09:46,578 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:09:46,605 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:09:46,634 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:09:46,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:46 WrapperNode [2018-11-23 10:09:46,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:09:46,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:09:46,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:09:46,636 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:09:46,646 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:09:46" (1/1) ... [2018-11-23 10:09:46,658 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:09:46" (1/1) ... [2018-11-23 10:09:46,668 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:09:46,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:09:46,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:09:46,668 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:09:46,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:46" (1/1) ... [2018-11-23 10:09:46,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:46" (1/1) ... [2018-11-23 10:09:46,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:46" (1/1) ... [2018-11-23 10:09:46,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:46" (1/1) ... [2018-11-23 10:09:46,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:46" (1/1) ... [2018-11-23 10:09:46,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:46" (1/1) ... [2018-11-23 10:09:46,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:46" (1/1) ... [2018-11-23 10:09:46,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:09:46,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:09:46,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:09:46,704 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:09:46,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:46" (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:09:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:09:46,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:09:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:09:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:09:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:09:46,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:09:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:09:46,821 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:09:46,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:09:46,822 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:09:46,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:09:46,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:09:47,353 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:09:47,355 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 10:09:47,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:09:47 BoogieIcfgContainer [2018-11-23 10:09:47,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:09:47,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:09:47,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:09:47,360 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:09:47,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:09:46" (1/3) ... [2018-11-23 10:09:47,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb2233e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:09:47, skipping insertion in model container [2018-11-23 10:09:47,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:46" (2/3) ... [2018-11-23 10:09:47,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb2233e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:09:47, skipping insertion in model container [2018-11-23 10:09:47,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:09:47" (3/3) ... [2018-11-23 10:09:47,364 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_palindrome_true-unreach-call_ground.i [2018-11-23 10:09:47,375 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:09:47,383 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:09:47,403 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:09:47,437 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:09:47,438 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:09:47,438 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:09:47,438 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:09:47,438 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:09:47,438 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:09:47,439 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:09:47,439 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:09:47,439 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:09:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 10:09:47,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 10:09:47,463 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:09:47,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:09:47,467 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:09:47,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:09:47,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1821336840, now seen corresponding path program 1 times [2018-11-23 10:09:47,479 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:09:47,479 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:09:47,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:09:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:47,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:09:47,627 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 10:09:47,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {27#true} is VALID [2018-11-23 10:09:47,631 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 10:09:47,631 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #49#return; {27#true} is VALID [2018-11-23 10:09:47,632 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2018-11-23 10:09:47,632 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~i~0 := 0bv32; {27#true} is VALID [2018-11-23 10:09:47,633 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 10:09:47,633 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} havoc ~x~0;~x~0 := 0bv32; {28#false} is VALID [2018-11-23 10:09:47,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume !!~bvslt32(~x~0, 50000bv32);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~x~0), 1bv32))), 4bv32); {28#false} is VALID [2018-11-23 10:09:47,634 INFO L256 TraceCheckUtils]: 9: Hoare triple {28#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {28#false} is VALID [2018-11-23 10:09:47,634 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 10:09:47,634 INFO L273 TraceCheckUtils]: 11: Hoare triple {28#false} assume 0bv32 == ~cond; {28#false} is VALID [2018-11-23 10:09:47,634 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 10:09:47,638 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:09:47,638 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:09:47,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:09:47,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:09:47,648 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 10:09:47,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:09:47,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:09:47,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:47,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:09:47,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:09:47,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:09:47,780 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 10:09:48,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:48,111 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-23 10:09:48,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:09:48,111 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 10:09:48,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:09:48,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:09:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2018-11-23 10:09:48,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:09:48,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2018-11-23 10:09:48,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 47 transitions. [2018-11-23 10:09:48,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:48,314 INFO L225 Difference]: With dead ends: 40 [2018-11-23 10:09:48,315 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 10:09:48,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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:09:48,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 10:09:48,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 10:09:48,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:09:48,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 10:09:48,378 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 10:09:48,378 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 10:09:48,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:48,382 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 10:09:48,382 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 10:09:48,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:48,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:48,383 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 10:09:48,383 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 10:09:48,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:48,387 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 10:09:48,387 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 10:09:48,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:48,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:48,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:09:48,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:09:48,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 10:09:48,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 10:09:48,393 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2018-11-23 10:09:48,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:09:48,393 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 10:09:48,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:09:48,394 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 10:09:48,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 10:09:48,395 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:09:48,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:09:48,395 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:09:48,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:09:48,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1443575666, now seen corresponding path program 1 times [2018-11-23 10:09:48,396 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:09:48,396 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:09:48,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:09:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:48,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:09:48,605 INFO L256 TraceCheckUtils]: 0: Hoare triple {183#true} call ULTIMATE.init(); {183#true} is VALID [2018-11-23 10:09:48,606 INFO L273 TraceCheckUtils]: 1: Hoare triple {183#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {183#true} is VALID [2018-11-23 10:09:48,606 INFO L273 TraceCheckUtils]: 2: Hoare triple {183#true} assume true; {183#true} is VALID [2018-11-23 10:09:48,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {183#true} {183#true} #49#return; {183#true} is VALID [2018-11-23 10:09:48,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {183#true} call #t~ret5 := main(); {183#true} is VALID [2018-11-23 10:09:48,609 INFO L273 TraceCheckUtils]: 5: Hoare triple {183#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~i~0 := 0bv32; {203#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:09:48,612 INFO L273 TraceCheckUtils]: 6: Hoare triple {203#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 50000bv32); {184#false} is VALID [2018-11-23 10:09:48,612 INFO L273 TraceCheckUtils]: 7: Hoare triple {184#false} havoc ~x~0;~x~0 := 0bv32; {184#false} is VALID [2018-11-23 10:09:48,612 INFO L273 TraceCheckUtils]: 8: Hoare triple {184#false} assume !!~bvslt32(~x~0, 50000bv32);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~x~0), 1bv32))), 4bv32); {184#false} is VALID [2018-11-23 10:09:48,613 INFO L256 TraceCheckUtils]: 9: Hoare triple {184#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {184#false} is VALID [2018-11-23 10:09:48,613 INFO L273 TraceCheckUtils]: 10: Hoare triple {184#false} ~cond := #in~cond; {184#false} is VALID [2018-11-23 10:09:48,613 INFO L273 TraceCheckUtils]: 11: Hoare triple {184#false} assume 0bv32 == ~cond; {184#false} is VALID [2018-11-23 10:09:48,614 INFO L273 TraceCheckUtils]: 12: Hoare triple {184#false} assume !false; {184#false} is VALID [2018-11-23 10:09:48,615 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:09:48,615 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:09:48,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:09:48,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:09:48,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 10:09:48,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:09:48,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:09:48,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:48,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:09:48,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:09:48,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:09:48,652 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 3 states. [2018-11-23 10:09:48,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:48,765 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-23 10:09:48,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:09:48,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 10:09:48,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:09:48,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:09:48,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 10:09:48,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:09:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 10:09:48,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2018-11-23 10:09:48,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:48,957 INFO L225 Difference]: With dead ends: 32 [2018-11-23 10:09:48,957 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 10:09:48,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:09:48,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 10:09:49,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-23 10:09:49,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:09:49,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 20 states. [2018-11-23 10:09:49,074 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 20 states. [2018-11-23 10:09:49,074 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 20 states. [2018-11-23 10:09:49,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:49,078 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 10:09:49,078 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 10:09:49,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:49,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:49,079 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states. [2018-11-23 10:09:49,079 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states. [2018-11-23 10:09:49,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:49,089 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 10:09:49,089 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 10:09:49,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:49,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:49,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:09:49,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:09:49,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 10:09:49,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 10:09:49,095 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2018-11-23 10:09:49,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:09:49,096 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 10:09:49,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:09:49,096 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 10:09:49,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:09:49,098 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:09:49,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:09:49,099 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:09:49,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:09:49,099 INFO L82 PathProgramCache]: Analyzing trace with hash 31729808, now seen corresponding path program 1 times [2018-11-23 10:09:49,100 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:09:49,100 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:09:49,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:09:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:49,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:09:49,305 INFO L256 TraceCheckUtils]: 0: Hoare triple {339#true} call ULTIMATE.init(); {339#true} is VALID [2018-11-23 10:09:49,305 INFO L273 TraceCheckUtils]: 1: Hoare triple {339#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {339#true} is VALID [2018-11-23 10:09:49,305 INFO L273 TraceCheckUtils]: 2: Hoare triple {339#true} assume true; {339#true} is VALID [2018-11-23 10:09:49,306 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {339#true} {339#true} #49#return; {339#true} is VALID [2018-11-23 10:09:49,306 INFO L256 TraceCheckUtils]: 4: Hoare triple {339#true} call #t~ret5 := main(); {339#true} is VALID [2018-11-23 10:09:49,307 INFO L273 TraceCheckUtils]: 5: Hoare triple {339#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~i~0 := 0bv32; {359#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:09:49,308 INFO L273 TraceCheckUtils]: 6: Hoare triple {359#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {359#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:09:49,308 INFO L273 TraceCheckUtils]: 7: Hoare triple {359#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {366#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:49,310 INFO L273 TraceCheckUtils]: 8: Hoare triple {366#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 50000bv32); {340#false} is VALID [2018-11-23 10:09:49,310 INFO L273 TraceCheckUtils]: 9: Hoare triple {340#false} havoc ~x~0;~x~0 := 0bv32; {340#false} is VALID [2018-11-23 10:09:49,310 INFO L273 TraceCheckUtils]: 10: Hoare triple {340#false} assume !!~bvslt32(~x~0, 50000bv32);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~x~0), 1bv32))), 4bv32); {340#false} is VALID [2018-11-23 10:09:49,310 INFO L256 TraceCheckUtils]: 11: Hoare triple {340#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {340#false} is VALID [2018-11-23 10:09:49,311 INFO L273 TraceCheckUtils]: 12: Hoare triple {340#false} ~cond := #in~cond; {340#false} is VALID [2018-11-23 10:09:49,311 INFO L273 TraceCheckUtils]: 13: Hoare triple {340#false} assume 0bv32 == ~cond; {340#false} is VALID [2018-11-23 10:09:49,311 INFO L273 TraceCheckUtils]: 14: Hoare triple {340#false} assume !false; {340#false} is VALID [2018-11-23 10:09:49,313 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:09:49,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:09:49,639 INFO L273 TraceCheckUtils]: 14: Hoare triple {340#false} assume !false; {340#false} is VALID [2018-11-23 10:09:49,639 INFO L273 TraceCheckUtils]: 13: Hoare triple {340#false} assume 0bv32 == ~cond; {340#false} is VALID [2018-11-23 10:09:49,640 INFO L273 TraceCheckUtils]: 12: Hoare triple {340#false} ~cond := #in~cond; {340#false} is VALID [2018-11-23 10:09:49,640 INFO L256 TraceCheckUtils]: 11: Hoare triple {340#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {340#false} is VALID [2018-11-23 10:09:49,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {340#false} assume !!~bvslt32(~x~0, 50000bv32);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~x~0), 1bv32))), 4bv32); {340#false} is VALID [2018-11-23 10:09:49,640 INFO L273 TraceCheckUtils]: 9: Hoare triple {340#false} havoc ~x~0;~x~0 := 0bv32; {340#false} is VALID [2018-11-23 10:09:49,642 INFO L273 TraceCheckUtils]: 8: Hoare triple {406#(bvslt main_~i~0 (_ bv50000 32))} assume !~bvslt32(~i~0, 50000bv32); {340#false} is VALID [2018-11-23 10:09:49,643 INFO L273 TraceCheckUtils]: 7: Hoare triple {410#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {406#(bvslt main_~i~0 (_ bv50000 32))} is VALID [2018-11-23 10:09:49,649 INFO L273 TraceCheckUtils]: 6: Hoare triple {410#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {410#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:49,650 INFO L273 TraceCheckUtils]: 5: Hoare triple {339#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~i~0 := 0bv32; {410#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:49,650 INFO L256 TraceCheckUtils]: 4: Hoare triple {339#true} call #t~ret5 := main(); {339#true} is VALID [2018-11-23 10:09:49,650 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {339#true} {339#true} #49#return; {339#true} is VALID [2018-11-23 10:09:49,651 INFO L273 TraceCheckUtils]: 2: Hoare triple {339#true} assume true; {339#true} is VALID [2018-11-23 10:09:49,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {339#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {339#true} is VALID [2018-11-23 10:09:49,651 INFO L256 TraceCheckUtils]: 0: Hoare triple {339#true} call ULTIMATE.init(); {339#true} is VALID [2018-11-23 10:09:49,652 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:09:49,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:09:49,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:09:49,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 10:09:49,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:09:49,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:09:49,696 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:09:49,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:09:49,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:09:49,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:09:49,698 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 6 states. [2018-11-23 10:09:50,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:50,045 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 10:09:50,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:09:50,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 10:09:50,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:09:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:09:50,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2018-11-23 10:09:50,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:09:50,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2018-11-23 10:09:50,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2018-11-23 10:09:50,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:50,157 INFO L225 Difference]: With dead ends: 37 [2018-11-23 10:09:50,157 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 10:09:50,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:09:50,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 10:09:50,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 10:09:50,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:09:50,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 10:09:50,178 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 10:09:50,179 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 10:09:50,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:50,181 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 10:09:50,181 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 10:09:50,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:50,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:50,183 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 10:09:50,183 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 10:09:50,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:50,185 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 10:09:50,185 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 10:09:50,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:50,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:50,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:09:50,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:09:50,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:09:50,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-23 10:09:50,189 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 15 [2018-11-23 10:09:50,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:09:50,190 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-23 10:09:50,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:09:50,190 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 10:09:50,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:09:50,191 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:09:50,191 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:09:50,191 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:09:50,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:09:50,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1149264150, now seen corresponding path program 2 times [2018-11-23 10:09:50,192 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:09:50,193 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:09:50,210 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:09:50,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:09:50,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:09:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:50,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:09:50,510 INFO L256 TraceCheckUtils]: 0: Hoare triple {578#true} call ULTIMATE.init(); {578#true} is VALID [2018-11-23 10:09:50,511 INFO L273 TraceCheckUtils]: 1: Hoare triple {578#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {578#true} is VALID [2018-11-23 10:09:50,511 INFO L273 TraceCheckUtils]: 2: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-23 10:09:50,511 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {578#true} {578#true} #49#return; {578#true} is VALID [2018-11-23 10:09:50,512 INFO L256 TraceCheckUtils]: 4: Hoare triple {578#true} call #t~ret5 := main(); {578#true} is VALID [2018-11-23 10:09:50,512 INFO L273 TraceCheckUtils]: 5: Hoare triple {578#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~i~0 := 0bv32; {598#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:09:50,515 INFO L273 TraceCheckUtils]: 6: Hoare triple {598#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {598#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:09:50,517 INFO L273 TraceCheckUtils]: 7: Hoare triple {598#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {605#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:50,517 INFO L273 TraceCheckUtils]: 8: Hoare triple {605#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {605#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:50,519 INFO L273 TraceCheckUtils]: 9: Hoare triple {605#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {612#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:09:50,520 INFO L273 TraceCheckUtils]: 10: Hoare triple {612#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {612#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:09:50,522 INFO L273 TraceCheckUtils]: 11: Hoare triple {612#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {619#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:50,523 INFO L273 TraceCheckUtils]: 12: Hoare triple {619#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {619#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:50,523 INFO L273 TraceCheckUtils]: 13: Hoare triple {619#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {626#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:09:50,524 INFO L273 TraceCheckUtils]: 14: Hoare triple {626#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 50000bv32); {579#false} is VALID [2018-11-23 10:09:50,524 INFO L273 TraceCheckUtils]: 15: Hoare triple {579#false} havoc ~x~0;~x~0 := 0bv32; {579#false} is VALID [2018-11-23 10:09:50,524 INFO L273 TraceCheckUtils]: 16: Hoare triple {579#false} assume !!~bvslt32(~x~0, 50000bv32);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~x~0), 1bv32))), 4bv32); {579#false} is VALID [2018-11-23 10:09:50,525 INFO L256 TraceCheckUtils]: 17: Hoare triple {579#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {579#false} is VALID [2018-11-23 10:09:50,525 INFO L273 TraceCheckUtils]: 18: Hoare triple {579#false} ~cond := #in~cond; {579#false} is VALID [2018-11-23 10:09:50,525 INFO L273 TraceCheckUtils]: 19: Hoare triple {579#false} assume 0bv32 == ~cond; {579#false} is VALID [2018-11-23 10:09:50,526 INFO L273 TraceCheckUtils]: 20: Hoare triple {579#false} assume !false; {579#false} is VALID [2018-11-23 10:09:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:09:50,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:09:50,730 INFO L273 TraceCheckUtils]: 20: Hoare triple {579#false} assume !false; {579#false} is VALID [2018-11-23 10:09:50,731 INFO L273 TraceCheckUtils]: 19: Hoare triple {579#false} assume 0bv32 == ~cond; {579#false} is VALID [2018-11-23 10:09:50,731 INFO L273 TraceCheckUtils]: 18: Hoare triple {579#false} ~cond := #in~cond; {579#false} is VALID [2018-11-23 10:09:50,731 INFO L256 TraceCheckUtils]: 17: Hoare triple {579#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {579#false} is VALID [2018-11-23 10:09:50,732 INFO L273 TraceCheckUtils]: 16: Hoare triple {579#false} assume !!~bvslt32(~x~0, 50000bv32);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~x~0), 1bv32))), 4bv32); {579#false} is VALID [2018-11-23 10:09:50,732 INFO L273 TraceCheckUtils]: 15: Hoare triple {579#false} havoc ~x~0;~x~0 := 0bv32; {579#false} is VALID [2018-11-23 10:09:50,732 INFO L273 TraceCheckUtils]: 14: Hoare triple {666#(bvslt main_~i~0 (_ bv50000 32))} assume !~bvslt32(~i~0, 50000bv32); {579#false} is VALID [2018-11-23 10:09:50,733 INFO L273 TraceCheckUtils]: 13: Hoare triple {670#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {666#(bvslt main_~i~0 (_ bv50000 32))} is VALID [2018-11-23 10:09:50,733 INFO L273 TraceCheckUtils]: 12: Hoare triple {670#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {670#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:50,738 INFO L273 TraceCheckUtils]: 11: Hoare triple {677#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {670#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:50,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {677#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {677#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:50,746 INFO L273 TraceCheckUtils]: 9: Hoare triple {684#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {677#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:50,747 INFO L273 TraceCheckUtils]: 8: Hoare triple {684#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {684#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:50,752 INFO L273 TraceCheckUtils]: 7: Hoare triple {691#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {684#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:50,753 INFO L273 TraceCheckUtils]: 6: Hoare triple {691#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {691#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:50,754 INFO L273 TraceCheckUtils]: 5: Hoare triple {578#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~i~0 := 0bv32; {691#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:50,754 INFO L256 TraceCheckUtils]: 4: Hoare triple {578#true} call #t~ret5 := main(); {578#true} is VALID [2018-11-23 10:09:50,754 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {578#true} {578#true} #49#return; {578#true} is VALID [2018-11-23 10:09:50,755 INFO L273 TraceCheckUtils]: 2: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-23 10:09:50,755 INFO L273 TraceCheckUtils]: 1: Hoare triple {578#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {578#true} is VALID [2018-11-23 10:09:50,755 INFO L256 TraceCheckUtils]: 0: Hoare triple {578#true} call ULTIMATE.init(); {578#true} is VALID [2018-11-23 10:09:50,757 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:09:50,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:09:50,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:09:50,760 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-23 10:09:50,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:09:50,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:09:50,834 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:09:50,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:09:50,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:09:50,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:09:50,835 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 12 states. [2018-11-23 10:09:51,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:51,863 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-23 10:09:51,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:09:51,863 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-23 10:09:51,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:09:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:09:51,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2018-11-23 10:09:51,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:09:51,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2018-11-23 10:09:51,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2018-11-23 10:09:51,983 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:51,986 INFO L225 Difference]: With dead ends: 49 [2018-11-23 10:09:51,987 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 10:09:51,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 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:09:51,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 10:09:52,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 10:09:52,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:09:52,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-23 10:09:52,009 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 10:09:52,009 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 10:09:52,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:52,014 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-23 10:09:52,014 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-23 10:09:52,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:52,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:52,015 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 10:09:52,015 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 10:09:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:52,018 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-23 10:09:52,019 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-23 10:09:52,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:52,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:52,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:09:52,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:09:52,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 10:09:52,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-23 10:09:52,022 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 21 [2018-11-23 10:09:52,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:09:52,023 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-23 10:09:52,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:09:52,023 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-23 10:09:52,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 10:09:52,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:09:52,024 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:09:52,025 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:09:52,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:09:52,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1253693154, now seen corresponding path program 3 times [2018-11-23 10:09:52,026 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:09:52,026 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:09:52,059 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:09:52,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 10:09:52,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:09:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:53,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:09:53,329 INFO L256 TraceCheckUtils]: 0: Hoare triple {925#true} call ULTIMATE.init(); {925#true} is VALID [2018-11-23 10:09:53,329 INFO L273 TraceCheckUtils]: 1: Hoare triple {925#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {925#true} is VALID [2018-11-23 10:09:53,330 INFO L273 TraceCheckUtils]: 2: Hoare triple {925#true} assume true; {925#true} is VALID [2018-11-23 10:09:53,330 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {925#true} {925#true} #49#return; {925#true} is VALID [2018-11-23 10:09:53,331 INFO L256 TraceCheckUtils]: 4: Hoare triple {925#true} call #t~ret5 := main(); {925#true} is VALID [2018-11-23 10:09:53,332 INFO L273 TraceCheckUtils]: 5: Hoare triple {925#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~i~0 := 0bv32; {945#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:09:53,332 INFO L273 TraceCheckUtils]: 6: Hoare triple {945#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {945#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:09:53,336 INFO L273 TraceCheckUtils]: 7: Hoare triple {945#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {952#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:53,337 INFO L273 TraceCheckUtils]: 8: Hoare triple {952#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {952#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:53,338 INFO L273 TraceCheckUtils]: 9: Hoare triple {952#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {959#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:09:53,338 INFO L273 TraceCheckUtils]: 10: Hoare triple {959#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {959#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:09:53,340 INFO L273 TraceCheckUtils]: 11: Hoare triple {959#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {966#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:53,341 INFO L273 TraceCheckUtils]: 12: Hoare triple {966#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {966#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:53,342 INFO L273 TraceCheckUtils]: 13: Hoare triple {966#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {973#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:09:53,342 INFO L273 TraceCheckUtils]: 14: Hoare triple {973#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {973#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:09:53,344 INFO L273 TraceCheckUtils]: 15: Hoare triple {973#(= (_ bv4 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {980#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:53,344 INFO L273 TraceCheckUtils]: 16: Hoare triple {980#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {980#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:53,345 INFO L273 TraceCheckUtils]: 17: Hoare triple {980#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {987#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:09:53,346 INFO L273 TraceCheckUtils]: 18: Hoare triple {987#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {987#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:09:53,347 INFO L273 TraceCheckUtils]: 19: Hoare triple {987#(= (_ bv6 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {994#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:53,348 INFO L273 TraceCheckUtils]: 20: Hoare triple {994#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {994#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:53,349 INFO L273 TraceCheckUtils]: 21: Hoare triple {994#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1001#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:09:53,350 INFO L273 TraceCheckUtils]: 22: Hoare triple {1001#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1001#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:09:53,365 INFO L273 TraceCheckUtils]: 23: Hoare triple {1001#(= (_ bv8 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1008#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:53,367 INFO L273 TraceCheckUtils]: 24: Hoare triple {1008#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1008#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:53,367 INFO L273 TraceCheckUtils]: 25: Hoare triple {1008#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1015#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:09:53,368 INFO L273 TraceCheckUtils]: 26: Hoare triple {1015#(= (_ bv10 32) main_~i~0)} assume !~bvslt32(~i~0, 50000bv32); {926#false} is VALID [2018-11-23 10:09:53,369 INFO L273 TraceCheckUtils]: 27: Hoare triple {926#false} havoc ~x~0;~x~0 := 0bv32; {926#false} is VALID [2018-11-23 10:09:53,369 INFO L273 TraceCheckUtils]: 28: Hoare triple {926#false} assume !!~bvslt32(~x~0, 50000bv32);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~x~0), 1bv32))), 4bv32); {926#false} is VALID [2018-11-23 10:09:53,370 INFO L256 TraceCheckUtils]: 29: Hoare triple {926#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {926#false} is VALID [2018-11-23 10:09:53,371 INFO L273 TraceCheckUtils]: 30: Hoare triple {926#false} ~cond := #in~cond; {926#false} is VALID [2018-11-23 10:09:53,371 INFO L273 TraceCheckUtils]: 31: Hoare triple {926#false} assume 0bv32 == ~cond; {926#false} is VALID [2018-11-23 10:09:53,372 INFO L273 TraceCheckUtils]: 32: Hoare triple {926#false} assume !false; {926#false} is VALID [2018-11-23 10:09:53,374 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:09:53,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:09:54,042 INFO L273 TraceCheckUtils]: 32: Hoare triple {926#false} assume !false; {926#false} is VALID [2018-11-23 10:09:54,043 INFO L273 TraceCheckUtils]: 31: Hoare triple {926#false} assume 0bv32 == ~cond; {926#false} is VALID [2018-11-23 10:09:54,043 INFO L273 TraceCheckUtils]: 30: Hoare triple {926#false} ~cond := #in~cond; {926#false} is VALID [2018-11-23 10:09:54,043 INFO L256 TraceCheckUtils]: 29: Hoare triple {926#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {926#false} is VALID [2018-11-23 10:09:54,043 INFO L273 TraceCheckUtils]: 28: Hoare triple {926#false} assume !!~bvslt32(~x~0, 50000bv32);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~x~0), 1bv32))), 4bv32); {926#false} is VALID [2018-11-23 10:09:54,044 INFO L273 TraceCheckUtils]: 27: Hoare triple {926#false} havoc ~x~0;~x~0 := 0bv32; {926#false} is VALID [2018-11-23 10:09:54,044 INFO L273 TraceCheckUtils]: 26: Hoare triple {1055#(bvslt main_~i~0 (_ bv50000 32))} assume !~bvslt32(~i~0, 50000bv32); {926#false} is VALID [2018-11-23 10:09:54,045 INFO L273 TraceCheckUtils]: 25: Hoare triple {1059#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1055#(bvslt main_~i~0 (_ bv50000 32))} is VALID [2018-11-23 10:09:54,045 INFO L273 TraceCheckUtils]: 24: Hoare triple {1059#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1059#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:54,052 INFO L273 TraceCheckUtils]: 23: Hoare triple {1066#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1059#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:54,052 INFO L273 TraceCheckUtils]: 22: Hoare triple {1066#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1066#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:54,059 INFO L273 TraceCheckUtils]: 21: Hoare triple {1073#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1066#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:54,059 INFO L273 TraceCheckUtils]: 20: Hoare triple {1073#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1073#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:54,066 INFO L273 TraceCheckUtils]: 19: Hoare triple {1080#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1073#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:54,067 INFO L273 TraceCheckUtils]: 18: Hoare triple {1080#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1080#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:54,074 INFO L273 TraceCheckUtils]: 17: Hoare triple {1087#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1080#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:54,080 INFO L273 TraceCheckUtils]: 16: Hoare triple {1087#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1087#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:54,085 INFO L273 TraceCheckUtils]: 15: Hoare triple {1094#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1087#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:54,086 INFO L273 TraceCheckUtils]: 14: Hoare triple {1094#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1094#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:54,092 INFO L273 TraceCheckUtils]: 13: Hoare triple {1101#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1094#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:54,092 INFO L273 TraceCheckUtils]: 12: Hoare triple {1101#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1101#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:54,100 INFO L273 TraceCheckUtils]: 11: Hoare triple {1108#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1101#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:54,100 INFO L273 TraceCheckUtils]: 10: Hoare triple {1108#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1108#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:54,107 INFO L273 TraceCheckUtils]: 9: Hoare triple {1115#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1108#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:54,108 INFO L273 TraceCheckUtils]: 8: Hoare triple {1115#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1115#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:54,113 INFO L273 TraceCheckUtils]: 7: Hoare triple {1122#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1115#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:54,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {1122#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1122#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:54,115 INFO L273 TraceCheckUtils]: 5: Hoare triple {925#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~i~0 := 0bv32; {1122#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv50000 32))} is VALID [2018-11-23 10:09:54,115 INFO L256 TraceCheckUtils]: 4: Hoare triple {925#true} call #t~ret5 := main(); {925#true} is VALID [2018-11-23 10:09:54,115 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {925#true} {925#true} #49#return; {925#true} is VALID [2018-11-23 10:09:54,115 INFO L273 TraceCheckUtils]: 2: Hoare triple {925#true} assume true; {925#true} is VALID [2018-11-23 10:09:54,116 INFO L273 TraceCheckUtils]: 1: Hoare triple {925#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {925#true} is VALID [2018-11-23 10:09:54,116 INFO L256 TraceCheckUtils]: 0: Hoare triple {925#true} call ULTIMATE.init(); {925#true} is VALID [2018-11-23 10:09:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:09:54,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:09:54,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:09:54,123 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2018-11-23 10:09:54,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:09:54,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:09:54,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:54,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:09:54,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:09:54,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:09:54,342 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 24 states. [2018-11-23 10:09:57,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:57,917 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2018-11-23 10:09:57,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:09:57,918 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2018-11-23 10:09:57,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:09:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:09:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 86 transitions. [2018-11-23 10:09:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:09:57,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 86 transitions. [2018-11-23 10:09:57,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 86 transitions. [2018-11-23 10:09:58,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:58,239 INFO L225 Difference]: With dead ends: 73 [2018-11-23 10:09:58,240 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 10:09:58,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:09:58,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 10:09:58,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-23 10:09:58,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:09:58,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2018-11-23 10:09:58,302 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-23 10:09:58,302 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-23 10:09:58,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:58,305 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-11-23 10:09:58,305 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-23 10:09:58,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:58,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:58,306 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-23 10:09:58,307 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-23 10:09:58,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:58,309 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-11-23 10:09:58,310 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-23 10:09:58,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:58,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:58,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:09:58,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:09:58,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 10:09:58,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-11-23 10:09:58,314 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 33 [2018-11-23 10:09:58,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:09:58,314 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-11-23 10:09:58,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:09:58,314 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-23 10:09:58,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 10:09:58,316 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:09:58,316 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:09:58,317 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:09:58,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:09:58,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1253887098, now seen corresponding path program 4 times [2018-11-23 10:09:58,318 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:09:58,318 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:09:58,335 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:09:58,439 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:09:58,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:09:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:58,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:09:59,325 INFO L256 TraceCheckUtils]: 0: Hoare triple {1488#true} call ULTIMATE.init(); {1488#true} is VALID [2018-11-23 10:09:59,325 INFO L273 TraceCheckUtils]: 1: Hoare triple {1488#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1488#true} is VALID [2018-11-23 10:09:59,326 INFO L273 TraceCheckUtils]: 2: Hoare triple {1488#true} assume true; {1488#true} is VALID [2018-11-23 10:09:59,326 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1488#true} {1488#true} #49#return; {1488#true} is VALID [2018-11-23 10:09:59,326 INFO L256 TraceCheckUtils]: 4: Hoare triple {1488#true} call #t~ret5 := main(); {1488#true} is VALID [2018-11-23 10:09:59,327 INFO L273 TraceCheckUtils]: 5: Hoare triple {1488#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~i~0 := 0bv32; {1508#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:09:59,328 INFO L273 TraceCheckUtils]: 6: Hoare triple {1508#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1508#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:09:59,328 INFO L273 TraceCheckUtils]: 7: Hoare triple {1508#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1515#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,329 INFO L273 TraceCheckUtils]: 8: Hoare triple {1515#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1515#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,329 INFO L273 TraceCheckUtils]: 9: Hoare triple {1515#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1522#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:09:59,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {1522#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1522#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:09:59,331 INFO L273 TraceCheckUtils]: 11: Hoare triple {1522#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1529#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {1529#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1529#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,332 INFO L273 TraceCheckUtils]: 13: Hoare triple {1529#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1536#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:09:59,333 INFO L273 TraceCheckUtils]: 14: Hoare triple {1536#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1536#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:09:59,334 INFO L273 TraceCheckUtils]: 15: Hoare triple {1536#(= (_ bv4 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1543#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,335 INFO L273 TraceCheckUtils]: 16: Hoare triple {1543#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1543#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {1543#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1550#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:09:59,337 INFO L273 TraceCheckUtils]: 18: Hoare triple {1550#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1550#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:09:59,338 INFO L273 TraceCheckUtils]: 19: Hoare triple {1550#(= (_ bv6 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1557#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,338 INFO L273 TraceCheckUtils]: 20: Hoare triple {1557#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1557#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,339 INFO L273 TraceCheckUtils]: 21: Hoare triple {1557#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1564#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:09:59,340 INFO L273 TraceCheckUtils]: 22: Hoare triple {1564#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1564#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:09:59,341 INFO L273 TraceCheckUtils]: 23: Hoare triple {1564#(= (_ bv8 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1571#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,342 INFO L273 TraceCheckUtils]: 24: Hoare triple {1571#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1571#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,343 INFO L273 TraceCheckUtils]: 25: Hoare triple {1571#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1578#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:09:59,343 INFO L273 TraceCheckUtils]: 26: Hoare triple {1578#(= (_ bv10 32) main_~i~0)} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1578#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:09:59,344 INFO L273 TraceCheckUtils]: 27: Hoare triple {1578#(= (_ bv10 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1585#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,350 INFO L273 TraceCheckUtils]: 28: Hoare triple {1585#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1585#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,351 INFO L273 TraceCheckUtils]: 29: Hoare triple {1585#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1592#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:09:59,351 INFO L273 TraceCheckUtils]: 30: Hoare triple {1592#(= (_ bv12 32) main_~i~0)} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1592#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:09:59,352 INFO L273 TraceCheckUtils]: 31: Hoare triple {1592#(= (_ bv12 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1599#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,352 INFO L273 TraceCheckUtils]: 32: Hoare triple {1599#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1599#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,353 INFO L273 TraceCheckUtils]: 33: Hoare triple {1599#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1606#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 10:09:59,353 INFO L273 TraceCheckUtils]: 34: Hoare triple {1606#(= (_ bv14 32) main_~i~0)} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1606#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 10:09:59,354 INFO L273 TraceCheckUtils]: 35: Hoare triple {1606#(= (_ bv14 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1613#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,354 INFO L273 TraceCheckUtils]: 36: Hoare triple {1613#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1613#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,355 INFO L273 TraceCheckUtils]: 37: Hoare triple {1613#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1620#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:09:59,355 INFO L273 TraceCheckUtils]: 38: Hoare triple {1620#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1620#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:09:59,362 INFO L273 TraceCheckUtils]: 39: Hoare triple {1620#(= (_ bv16 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1627#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,363 INFO L273 TraceCheckUtils]: 40: Hoare triple {1627#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1627#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,364 INFO L273 TraceCheckUtils]: 41: Hoare triple {1627#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1634#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:09:59,364 INFO L273 TraceCheckUtils]: 42: Hoare triple {1634#(= (_ bv18 32) main_~i~0)} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1634#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:09:59,365 INFO L273 TraceCheckUtils]: 43: Hoare triple {1634#(= (_ bv18 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1641#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,383 INFO L273 TraceCheckUtils]: 44: Hoare triple {1641#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1641#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,398 INFO L273 TraceCheckUtils]: 45: Hoare triple {1641#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1648#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:09:59,405 INFO L273 TraceCheckUtils]: 46: Hoare triple {1648#(= (_ bv20 32) main_~i~0)} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1648#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:09:59,407 INFO L273 TraceCheckUtils]: 47: Hoare triple {1648#(= (_ bv20 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1655#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,407 INFO L273 TraceCheckUtils]: 48: Hoare triple {1655#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1655#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,409 INFO L273 TraceCheckUtils]: 49: Hoare triple {1655#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1662#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:59,410 INFO L273 TraceCheckUtils]: 50: Hoare triple {1662#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 50000bv32); {1489#false} is VALID [2018-11-23 10:09:59,410 INFO L273 TraceCheckUtils]: 51: Hoare triple {1489#false} havoc ~x~0;~x~0 := 0bv32; {1489#false} is VALID [2018-11-23 10:09:59,410 INFO L273 TraceCheckUtils]: 52: Hoare triple {1489#false} assume !!~bvslt32(~x~0, 50000bv32);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~x~0), 1bv32))), 4bv32); {1489#false} is VALID [2018-11-23 10:09:59,410 INFO L256 TraceCheckUtils]: 53: Hoare triple {1489#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {1489#false} is VALID [2018-11-23 10:09:59,411 INFO L273 TraceCheckUtils]: 54: Hoare triple {1489#false} ~cond := #in~cond; {1489#false} is VALID [2018-11-23 10:09:59,411 INFO L273 TraceCheckUtils]: 55: Hoare triple {1489#false} assume 0bv32 == ~cond; {1489#false} is VALID [2018-11-23 10:09:59,411 INFO L273 TraceCheckUtils]: 56: Hoare triple {1489#false} assume !false; {1489#false} is VALID [2018-11-23 10:09:59,416 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:09:59,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:10:01,772 INFO L273 TraceCheckUtils]: 56: Hoare triple {1489#false} assume !false; {1489#false} is VALID [2018-11-23 10:10:01,772 INFO L273 TraceCheckUtils]: 55: Hoare triple {1489#false} assume 0bv32 == ~cond; {1489#false} is VALID [2018-11-23 10:10:01,773 INFO L273 TraceCheckUtils]: 54: Hoare triple {1489#false} ~cond := #in~cond; {1489#false} is VALID [2018-11-23 10:10:01,773 INFO L256 TraceCheckUtils]: 53: Hoare triple {1489#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {1489#false} is VALID [2018-11-23 10:10:01,773 INFO L273 TraceCheckUtils]: 52: Hoare triple {1489#false} assume !!~bvslt32(~x~0, 50000bv32);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~x~0), 1bv32))), 4bv32); {1489#false} is VALID [2018-11-23 10:10:01,773 INFO L273 TraceCheckUtils]: 51: Hoare triple {1489#false} havoc ~x~0;~x~0 := 0bv32; {1489#false} is VALID [2018-11-23 10:10:01,774 INFO L273 TraceCheckUtils]: 50: Hoare triple {1702#(bvslt main_~i~0 (_ bv50000 32))} assume !~bvslt32(~i~0, 50000bv32); {1489#false} is VALID [2018-11-23 10:10:01,775 INFO L273 TraceCheckUtils]: 49: Hoare triple {1706#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1702#(bvslt main_~i~0 (_ bv50000 32))} is VALID [2018-11-23 10:10:01,776 INFO L273 TraceCheckUtils]: 48: Hoare triple {1706#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1706#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,782 INFO L273 TraceCheckUtils]: 47: Hoare triple {1713#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1706#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,783 INFO L273 TraceCheckUtils]: 46: Hoare triple {1713#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1713#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,790 INFO L273 TraceCheckUtils]: 45: Hoare triple {1720#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1713#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,790 INFO L273 TraceCheckUtils]: 44: Hoare triple {1720#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1720#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,797 INFO L273 TraceCheckUtils]: 43: Hoare triple {1727#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1720#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,797 INFO L273 TraceCheckUtils]: 42: Hoare triple {1727#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1727#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,806 INFO L273 TraceCheckUtils]: 41: Hoare triple {1734#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1727#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,806 INFO L273 TraceCheckUtils]: 40: Hoare triple {1734#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1734#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,811 INFO L273 TraceCheckUtils]: 39: Hoare triple {1741#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1734#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,811 INFO L273 TraceCheckUtils]: 38: Hoare triple {1741#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1741#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,818 INFO L273 TraceCheckUtils]: 37: Hoare triple {1748#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1741#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,818 INFO L273 TraceCheckUtils]: 36: Hoare triple {1748#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1748#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,823 INFO L273 TraceCheckUtils]: 35: Hoare triple {1755#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1748#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,824 INFO L273 TraceCheckUtils]: 34: Hoare triple {1755#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1755#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,831 INFO L273 TraceCheckUtils]: 33: Hoare triple {1762#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1755#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,831 INFO L273 TraceCheckUtils]: 32: Hoare triple {1762#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1762#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,838 INFO L273 TraceCheckUtils]: 31: Hoare triple {1769#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1762#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,838 INFO L273 TraceCheckUtils]: 30: Hoare triple {1769#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1769#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,844 INFO L273 TraceCheckUtils]: 29: Hoare triple {1776#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1769#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,845 INFO L273 TraceCheckUtils]: 28: Hoare triple {1776#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1776#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,854 INFO L273 TraceCheckUtils]: 27: Hoare triple {1783#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1776#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,854 INFO L273 TraceCheckUtils]: 26: Hoare triple {1783#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1783#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,859 INFO L273 TraceCheckUtils]: 25: Hoare triple {1790#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1783#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,860 INFO L273 TraceCheckUtils]: 24: Hoare triple {1790#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1790#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,866 INFO L273 TraceCheckUtils]: 23: Hoare triple {1797#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1790#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,870 INFO L273 TraceCheckUtils]: 22: Hoare triple {1797#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1797#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,875 INFO L273 TraceCheckUtils]: 21: Hoare triple {1804#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1797#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,876 INFO L273 TraceCheckUtils]: 20: Hoare triple {1804#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1804#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,880 INFO L273 TraceCheckUtils]: 19: Hoare triple {1811#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1804#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,881 INFO L273 TraceCheckUtils]: 18: Hoare triple {1811#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1811#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,886 INFO L273 TraceCheckUtils]: 17: Hoare triple {1818#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1811#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,887 INFO L273 TraceCheckUtils]: 16: Hoare triple {1818#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1818#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,892 INFO L273 TraceCheckUtils]: 15: Hoare triple {1825#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1818#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,893 INFO L273 TraceCheckUtils]: 14: Hoare triple {1825#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1825#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,900 INFO L273 TraceCheckUtils]: 13: Hoare triple {1832#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1825#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,901 INFO L273 TraceCheckUtils]: 12: Hoare triple {1832#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1832#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,911 INFO L273 TraceCheckUtils]: 11: Hoare triple {1839#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1832#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,912 INFO L273 TraceCheckUtils]: 10: Hoare triple {1839#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1839#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,918 INFO L273 TraceCheckUtils]: 9: Hoare triple {1846#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1839#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,918 INFO L273 TraceCheckUtils]: 8: Hoare triple {1846#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1846#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,926 INFO L273 TraceCheckUtils]: 7: Hoare triple {1853#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv50000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1846#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,927 INFO L273 TraceCheckUtils]: 6: Hoare triple {1853#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv50000 32))} assume !!~bvslt32(~i~0, 50000bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvsub32(100000bv32, ~i~0), 1bv32))), 4bv32);call write~intINTTYPE4(#t~mem1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1853#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,927 INFO L273 TraceCheckUtils]: 5: Hoare triple {1488#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~i~0 := 0bv32; {1853#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv50000 32))} is VALID [2018-11-23 10:10:01,927 INFO L256 TraceCheckUtils]: 4: Hoare triple {1488#true} call #t~ret5 := main(); {1488#true} is VALID [2018-11-23 10:10:01,928 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1488#true} {1488#true} #49#return; {1488#true} is VALID [2018-11-23 10:10:01,928 INFO L273 TraceCheckUtils]: 2: Hoare triple {1488#true} assume true; {1488#true} is VALID [2018-11-23 10:10:01,928 INFO L273 TraceCheckUtils]: 1: Hoare triple {1488#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1488#true} is VALID [2018-11-23 10:10:01,928 INFO L256 TraceCheckUtils]: 0: Hoare triple {1488#true} call ULTIMATE.init(); {1488#true} is VALID [2018-11-23 10:10:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:10:01,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:10:01,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:10:01,935 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 57 [2018-11-23 10:10:01,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:10:01,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:10:02,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:02,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:10:02,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:10:02,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:10:02,304 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 48 states. [2018-11-23 10:10:08,886 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:10:09,436 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:10:10,025 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:10:10,621 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:10:11,216 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:10:11,817 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:10:12,425 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 10:10:15,880 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 7 [2018-11-23 10:10:19,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:19,368 INFO L93 Difference]: Finished difference Result 121 states and 146 transitions. [2018-11-23 10:10:19,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:10:19,368 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 57 [2018-11-23 10:10:19,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:10:19,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:10:19,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 146 transitions. [2018-11-23 10:10:19,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:10:19,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 146 transitions. [2018-11-23 10:10:19,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 146 transitions. [2018-11-23 10:10:19,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:19,815 INFO L225 Difference]: With dead ends: 121 [2018-11-23 10:10:19,815 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 10:10:19,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:10:19,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 10:10:19,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-11-23 10:10:19,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:10:19,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 110 states. [2018-11-23 10:10:19,992 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 110 states. [2018-11-23 10:10:19,992 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 110 states. [2018-11-23 10:10:19,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:19,997 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2018-11-23 10:10:19,997 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2018-11-23 10:10:19,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:19,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:19,998 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 110 states. [2018-11-23 10:10:19,998 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 110 states. [2018-11-23 10:10:20,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:20,002 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2018-11-23 10:10:20,002 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2018-11-23 10:10:20,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:20,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:20,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:10:20,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:10:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 10:10:20,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2018-11-23 10:10:20,008 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 57 [2018-11-23 10:10:20,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:10:20,008 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2018-11-23 10:10:20,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:10:20,008 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2018-11-23 10:10:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-23 10:10:20,011 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:10:20,011 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:10:20,012 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:10:20,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:10:20,012 INFO L82 PathProgramCache]: Analyzing trace with hash -959897514, now seen corresponding path program 5 times [2018-11-23 10:10:20,013 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:10:20,013 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:10:20,032 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1