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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/reducercommutativity/sum40_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:54:21,566 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:54:21,568 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:54:21,580 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:54:21,581 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:54:21,582 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:54:21,583 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:54:21,585 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:54:21,587 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:54:21,588 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:54:21,589 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:54:21,589 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:54:21,590 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:54:21,591 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:54:21,592 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:54:21,593 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:54:21,593 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:54:21,595 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:54:21,598 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:54:21,599 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:54:21,600 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:54:21,602 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:54:21,604 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:54:21,604 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:54:21,605 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:54:21,606 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:54:21,607 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:54:21,607 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:54:21,608 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:54:21,609 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:54:21,610 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:54:21,610 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:54:21,611 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:54:21,611 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:54:21,612 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:54:21,613 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:54:21,613 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 17:54:21,628 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:54:21,629 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:54:21,630 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:54:21,630 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:54:21,634 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:54:21,634 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:54:21,634 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:54:21,634 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:54:21,635 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:54:21,635 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:54:21,635 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:54:21,635 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:54:21,635 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:54:21,636 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:54:21,636 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 17:54:21,636 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 17:54:21,636 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:54:21,636 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:54:21,636 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 17:54:21,637 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:54:21,638 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:54:21,638 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:54:21,638 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:54:21,638 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:54:21,638 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:54:21,639 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:54:21,639 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:54:21,639 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:54:21,639 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 17:54:21,639 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:54:21,639 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 17:54:21,640 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 17:54:21,640 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:54:21,693 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:54:21,708 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:54:21,712 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:54:21,714 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:54:21,714 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:54:21,715 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sum40_true-unreach-call.i [2018-11-14 17:54:21,777 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b13c49f96/4d56adbba1964fedb9f8e04a452f9294/FLAG6de0680d7 [2018-11-14 17:54:22,227 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:54:22,228 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum40_true-unreach-call.i [2018-11-14 17:54:22,234 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b13c49f96/4d56adbba1964fedb9f8e04a452f9294/FLAG6de0680d7 [2018-11-14 17:54:22,252 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b13c49f96/4d56adbba1964fedb9f8e04a452f9294 [2018-11-14 17:54:22,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:54:22,263 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:54:22,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:54:22,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:54:22,269 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:54:22,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:54:22" (1/1) ... [2018-11-14 17:54:22,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@451a83c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:22, skipping insertion in model container [2018-11-14 17:54:22,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:54:22" (1/1) ... [2018-11-14 17:54:22,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:54:22,309 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:54:22,581 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:54:22,593 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:54:22,621 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:54:22,641 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:54:22,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:22 WrapperNode [2018-11-14 17:54:22,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:54:22,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:54:22,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:54:22,643 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:54:22,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:22" (1/1) ... [2018-11-14 17:54:22,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:22" (1/1) ... [2018-11-14 17:54:22,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:22" (1/1) ... [2018-11-14 17:54:22,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:22" (1/1) ... [2018-11-14 17:54:22,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:22" (1/1) ... [2018-11-14 17:54:22,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:22" (1/1) ... [2018-11-14 17:54:22,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:22" (1/1) ... [2018-11-14 17:54:22,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:54:22,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:54:22,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:54:22,701 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:54:22,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:22" (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-14 17:54:22,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:54:22,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:54:22,835 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-11-14 17:54:22,835 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:54:22,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:54:22,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:54:22,835 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-11-14 17:54:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 17:54:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:54:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:54:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 17:54:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:54:22,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:54:22,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:54:22,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 17:54:23,495 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:54:23,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:54:23 BoogieIcfgContainer [2018-11-14 17:54:23,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:54:23,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:54:23,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:54:23,501 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:54:23,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:54:22" (1/3) ... [2018-11-14 17:54:23,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c65bde7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:54:23, skipping insertion in model container [2018-11-14 17:54:23,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:22" (2/3) ... [2018-11-14 17:54:23,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c65bde7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:54:23, skipping insertion in model container [2018-11-14 17:54:23,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:54:23" (3/3) ... [2018-11-14 17:54:23,505 INFO L112 eAbstractionObserver]: Analyzing ICFG sum40_true-unreach-call.i [2018-11-14 17:54:23,513 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:54:23,521 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:54:23,539 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:54:23,572 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:54:23,573 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:54:23,573 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:54:23,573 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:54:23,574 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:54:23,574 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:54:23,574 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:54:23,574 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:54:23,574 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:54:23,597 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-14 17:54:23,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:54:23,604 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:54:23,605 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:54:23,607 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:54:23,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:54:23,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1575634353, now seen corresponding path program 1 times [2018-11-14 17:54:23,618 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:54:23,619 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-14 17:54:23,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:54:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:54:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:54:23,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:54:23,970 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-14 17:54:23,975 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {37#true} is VALID [2018-11-14 17:54:23,976 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:54:23,976 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #69#return; {37#true} is VALID [2018-11-14 17:54:23,977 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret12 := main(); {37#true} is VALID [2018-11-14 17:54:23,977 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(160bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {37#true} is VALID [2018-11-14 17:54:23,990 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-14 17:54:23,991 INFO L256 TraceCheckUtils]: 7: Hoare triple {38#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {38#false} is VALID [2018-11-14 17:54:23,992 INFO L273 TraceCheckUtils]: 8: Hoare triple {38#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {38#false} is VALID [2018-11-14 17:54:23,992 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 17:54:23,992 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#false} #res := ~ret~0[32:0]; {38#false} is VALID [2018-11-14 17:54:23,993 INFO L273 TraceCheckUtils]: 11: Hoare triple {38#false} assume true; {38#false} is VALID [2018-11-14 17:54:23,993 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2018-11-14 17:54:23,994 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {38#false} is VALID [2018-11-14 17:54:23,994 INFO L256 TraceCheckUtils]: 14: Hoare triple {38#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {38#false} is VALID [2018-11-14 17:54:23,994 INFO L273 TraceCheckUtils]: 15: Hoare triple {38#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {38#false} is VALID [2018-11-14 17:54:23,995 INFO L273 TraceCheckUtils]: 16: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 17:54:23,996 INFO L273 TraceCheckUtils]: 17: Hoare triple {38#false} #res := ~ret~0[32:0]; {38#false} is VALID [2018-11-14 17:54:23,997 INFO L273 TraceCheckUtils]: 18: Hoare triple {38#false} assume true; {38#false} is VALID [2018-11-14 17:54:23,997 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2018-11-14 17:54:23,998 INFO L273 TraceCheckUtils]: 20: Hoare triple {38#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {38#false} is VALID [2018-11-14 17:54:23,998 INFO L273 TraceCheckUtils]: 21: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 17:54:23,998 INFO L273 TraceCheckUtils]: 22: Hoare triple {38#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(156bv32, ~#x~0.offset), 4bv32); {38#false} is VALID [2018-11-14 17:54:23,999 INFO L256 TraceCheckUtils]: 23: Hoare triple {38#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {38#false} is VALID [2018-11-14 17:54:23,999 INFO L273 TraceCheckUtils]: 24: Hoare triple {38#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {38#false} is VALID [2018-11-14 17:54:24,000 INFO L273 TraceCheckUtils]: 25: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 17:54:24,000 INFO L273 TraceCheckUtils]: 26: Hoare triple {38#false} #res := ~ret~0[32:0]; {38#false} is VALID [2018-11-14 17:54:24,000 INFO L273 TraceCheckUtils]: 27: Hoare triple {38#false} assume true; {38#false} is VALID [2018-11-14 17:54:24,002 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {38#false} {38#false} #77#return; {38#false} is VALID [2018-11-14 17:54:24,002 INFO L273 TraceCheckUtils]: 29: Hoare triple {38#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {38#false} is VALID [2018-11-14 17:54:24,002 INFO L273 TraceCheckUtils]: 30: Hoare triple {38#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {38#false} is VALID [2018-11-14 17:54:24,003 INFO L273 TraceCheckUtils]: 31: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-14 17:54:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 17:54:24,016 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:54:24,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:54:24,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:54:24,029 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 17:54:24,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:54:24,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:54:24,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:54:24,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:54:24,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:54:24,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:54:24,175 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-14 17:54:24,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:24,389 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2018-11-14 17:54:24,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:54:24,389 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 17:54:24,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:54:24,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:54:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 17:54:24,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:54:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 17:54:24,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2018-11-14 17:54:24,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:54:24,664 INFO L225 Difference]: With dead ends: 59 [2018-11-14 17:54:24,664 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 17:54:24,668 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 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-14 17:54:24,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 17:54:24,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-14 17:54:24,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:54:24,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-14 17:54:24,827 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:54:24,828 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:54:24,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:24,834 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 17:54:24,834 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:54:24,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:54:24,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:54:24,836 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:54:24,836 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:54:24,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:24,841 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 17:54:24,841 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:54:24,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:54:24,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:54:24,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:54:24,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:54:24,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:54:24,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-14 17:54:24,849 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2018-11-14 17:54:24,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:54:24,850 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-14 17:54:24,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:54:24,850 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:54:24,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 17:54:24,852 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:54:24,853 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:54:24,853 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:54:24,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:54:24,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1963798480, now seen corresponding path program 1 times [2018-11-14 17:54:24,854 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:54:24,855 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-14 17:54:24,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:54:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:54:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:54:24,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:54:25,371 INFO L256 TraceCheckUtils]: 0: Hoare triple {308#true} call ULTIMATE.init(); {308#true} is VALID [2018-11-14 17:54:25,371 INFO L273 TraceCheckUtils]: 1: Hoare triple {308#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {308#true} is VALID [2018-11-14 17:54:25,372 INFO L273 TraceCheckUtils]: 2: Hoare triple {308#true} assume true; {308#true} is VALID [2018-11-14 17:54:25,372 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {308#true} {308#true} #69#return; {308#true} is VALID [2018-11-14 17:54:25,372 INFO L256 TraceCheckUtils]: 4: Hoare triple {308#true} call #t~ret12 := main(); {308#true} is VALID [2018-11-14 17:54:25,390 INFO L273 TraceCheckUtils]: 5: Hoare triple {308#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(160bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {328#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:54:25,391 INFO L273 TraceCheckUtils]: 6: Hoare triple {328#(= main_~i~1 (_ bv0 32))} assume true; {328#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:54:25,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {328#(= main_~i~1 (_ bv0 32))} assume !~bvslt32(~i~1, 40bv32); {309#false} is VALID [2018-11-14 17:54:25,395 INFO L256 TraceCheckUtils]: 8: Hoare triple {309#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {309#false} is VALID [2018-11-14 17:54:25,395 INFO L273 TraceCheckUtils]: 9: Hoare triple {309#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {309#false} is VALID [2018-11-14 17:54:25,396 INFO L273 TraceCheckUtils]: 10: Hoare triple {309#false} assume true; {309#false} is VALID [2018-11-14 17:54:25,396 INFO L273 TraceCheckUtils]: 11: Hoare triple {309#false} assume !~bvslt32(~i~0, 40bv32); {309#false} is VALID [2018-11-14 17:54:25,397 INFO L273 TraceCheckUtils]: 12: Hoare triple {309#false} #res := ~ret~0[32:0]; {309#false} is VALID [2018-11-14 17:54:25,397 INFO L273 TraceCheckUtils]: 13: Hoare triple {309#false} assume true; {309#false} is VALID [2018-11-14 17:54:25,397 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {309#false} {309#false} #73#return; {309#false} is VALID [2018-11-14 17:54:25,398 INFO L273 TraceCheckUtils]: 15: Hoare triple {309#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {309#false} is VALID [2018-11-14 17:54:25,398 INFO L256 TraceCheckUtils]: 16: Hoare triple {309#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {309#false} is VALID [2018-11-14 17:54:25,398 INFO L273 TraceCheckUtils]: 17: Hoare triple {309#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {309#false} is VALID [2018-11-14 17:54:25,399 INFO L273 TraceCheckUtils]: 18: Hoare triple {309#false} assume true; {309#false} is VALID [2018-11-14 17:54:25,399 INFO L273 TraceCheckUtils]: 19: Hoare triple {309#false} assume !~bvslt32(~i~0, 40bv32); {309#false} is VALID [2018-11-14 17:54:25,399 INFO L273 TraceCheckUtils]: 20: Hoare triple {309#false} #res := ~ret~0[32:0]; {309#false} is VALID [2018-11-14 17:54:25,400 INFO L273 TraceCheckUtils]: 21: Hoare triple {309#false} assume true; {309#false} is VALID [2018-11-14 17:54:25,400 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {309#false} {309#false} #75#return; {309#false} is VALID [2018-11-14 17:54:25,400 INFO L273 TraceCheckUtils]: 23: Hoare triple {309#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {309#false} is VALID [2018-11-14 17:54:25,401 INFO L273 TraceCheckUtils]: 24: Hoare triple {309#false} assume true; {309#false} is VALID [2018-11-14 17:54:25,401 INFO L273 TraceCheckUtils]: 25: Hoare triple {309#false} assume !~bvslt32(~i~2, 39bv32); {309#false} is VALID [2018-11-14 17:54:25,401 INFO L273 TraceCheckUtils]: 26: Hoare triple {309#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(156bv32, ~#x~0.offset), 4bv32); {309#false} is VALID [2018-11-14 17:54:25,402 INFO L256 TraceCheckUtils]: 27: Hoare triple {309#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {309#false} is VALID [2018-11-14 17:54:25,402 INFO L273 TraceCheckUtils]: 28: Hoare triple {309#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {309#false} is VALID [2018-11-14 17:54:25,402 INFO L273 TraceCheckUtils]: 29: Hoare triple {309#false} assume true; {309#false} is VALID [2018-11-14 17:54:25,403 INFO L273 TraceCheckUtils]: 30: Hoare triple {309#false} assume !~bvslt32(~i~0, 40bv32); {309#false} is VALID [2018-11-14 17:54:25,403 INFO L273 TraceCheckUtils]: 31: Hoare triple {309#false} #res := ~ret~0[32:0]; {309#false} is VALID [2018-11-14 17:54:25,404 INFO L273 TraceCheckUtils]: 32: Hoare triple {309#false} assume true; {309#false} is VALID [2018-11-14 17:54:25,404 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {309#false} {309#false} #77#return; {309#false} is VALID [2018-11-14 17:54:25,404 INFO L273 TraceCheckUtils]: 34: Hoare triple {309#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {309#false} is VALID [2018-11-14 17:54:25,405 INFO L273 TraceCheckUtils]: 35: Hoare triple {309#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {309#false} is VALID [2018-11-14 17:54:25,405 INFO L273 TraceCheckUtils]: 36: Hoare triple {309#false} assume !false; {309#false} is VALID [2018-11-14 17:54:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:54:25,408 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:54:25,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:54:25,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:54:25,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-14 17:54:25,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:54:25,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:54:25,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:54:25,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:54:25,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:54:25,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:54:25,537 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-11-14 17:54:25,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:25,733 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-14 17:54:25,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:54:25,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-14 17:54:25,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:54:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:54:25,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 17:54:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:54:25,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 17:54:25,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2018-11-14 17:54:25,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:54:25,988 INFO L225 Difference]: With dead ends: 52 [2018-11-14 17:54:25,989 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 17:54:25,990 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:54:25,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 17:54:26,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-14 17:54:26,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:54:26,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-14 17:54:26,006 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-14 17:54:26,006 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-14 17:54:26,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:26,011 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 17:54:26,011 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 17:54:26,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:54:26,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:54:26,012 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-14 17:54:26,012 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-14 17:54:26,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:26,016 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 17:54:26,016 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 17:54:26,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:54:26,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:54:26,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:54:26,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:54:26,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:54:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-14 17:54:26,020 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 37 [2018-11-14 17:54:26,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:54:26,021 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-14 17:54:26,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:54:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 17:54:26,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 17:54:26,023 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:54:26,023 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:54:26,023 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:54:26,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:54:26,024 INFO L82 PathProgramCache]: Analyzing trace with hash -600213610, now seen corresponding path program 1 times [2018-11-14 17:54:26,025 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:54:26,025 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-14 17:54:26,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:54:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:54:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:54:26,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:54:26,244 INFO L256 TraceCheckUtils]: 0: Hoare triple {598#true} call ULTIMATE.init(); {598#true} is VALID [2018-11-14 17:54:26,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {598#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {598#true} is VALID [2018-11-14 17:54:26,245 INFO L273 TraceCheckUtils]: 2: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:54:26,246 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {598#true} {598#true} #69#return; {598#true} is VALID [2018-11-14 17:54:26,246 INFO L256 TraceCheckUtils]: 4: Hoare triple {598#true} call #t~ret12 := main(); {598#true} is VALID [2018-11-14 17:54:26,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {598#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(160bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {618#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:54:26,251 INFO L273 TraceCheckUtils]: 6: Hoare triple {618#(= main_~i~1 (_ bv0 32))} assume true; {618#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:54:26,252 INFO L273 TraceCheckUtils]: 7: Hoare triple {618#(= main_~i~1 (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {618#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:54:26,253 INFO L273 TraceCheckUtils]: 8: Hoare triple {618#(= main_~i~1 (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {628#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:26,258 INFO L273 TraceCheckUtils]: 9: Hoare triple {628#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume true; {628#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:26,264 INFO L273 TraceCheckUtils]: 10: Hoare triple {628#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~1, 40bv32); {599#false} is VALID [2018-11-14 17:54:26,264 INFO L256 TraceCheckUtils]: 11: Hoare triple {599#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {599#false} is VALID [2018-11-14 17:54:26,265 INFO L273 TraceCheckUtils]: 12: Hoare triple {599#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {599#false} is VALID [2018-11-14 17:54:26,266 INFO L273 TraceCheckUtils]: 13: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:54:26,266 INFO L273 TraceCheckUtils]: 14: Hoare triple {599#false} assume !~bvslt32(~i~0, 40bv32); {599#false} is VALID [2018-11-14 17:54:26,266 INFO L273 TraceCheckUtils]: 15: Hoare triple {599#false} #res := ~ret~0[32:0]; {599#false} is VALID [2018-11-14 17:54:26,266 INFO L273 TraceCheckUtils]: 16: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:54:26,267 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {599#false} {599#false} #73#return; {599#false} is VALID [2018-11-14 17:54:26,267 INFO L273 TraceCheckUtils]: 18: Hoare triple {599#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {599#false} is VALID [2018-11-14 17:54:26,267 INFO L256 TraceCheckUtils]: 19: Hoare triple {599#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {599#false} is VALID [2018-11-14 17:54:26,268 INFO L273 TraceCheckUtils]: 20: Hoare triple {599#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {599#false} is VALID [2018-11-14 17:54:26,268 INFO L273 TraceCheckUtils]: 21: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:54:26,268 INFO L273 TraceCheckUtils]: 22: Hoare triple {599#false} assume !~bvslt32(~i~0, 40bv32); {599#false} is VALID [2018-11-14 17:54:26,269 INFO L273 TraceCheckUtils]: 23: Hoare triple {599#false} #res := ~ret~0[32:0]; {599#false} is VALID [2018-11-14 17:54:26,269 INFO L273 TraceCheckUtils]: 24: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:54:26,269 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {599#false} {599#false} #75#return; {599#false} is VALID [2018-11-14 17:54:26,270 INFO L273 TraceCheckUtils]: 26: Hoare triple {599#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {599#false} is VALID [2018-11-14 17:54:26,270 INFO L273 TraceCheckUtils]: 27: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:54:26,270 INFO L273 TraceCheckUtils]: 28: Hoare triple {599#false} assume !~bvslt32(~i~2, 39bv32); {599#false} is VALID [2018-11-14 17:54:26,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {599#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(156bv32, ~#x~0.offset), 4bv32); {599#false} is VALID [2018-11-14 17:54:26,271 INFO L256 TraceCheckUtils]: 30: Hoare triple {599#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {599#false} is VALID [2018-11-14 17:54:26,271 INFO L273 TraceCheckUtils]: 31: Hoare triple {599#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {599#false} is VALID [2018-11-14 17:54:26,272 INFO L273 TraceCheckUtils]: 32: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:54:26,272 INFO L273 TraceCheckUtils]: 33: Hoare triple {599#false} assume !~bvslt32(~i~0, 40bv32); {599#false} is VALID [2018-11-14 17:54:26,272 INFO L273 TraceCheckUtils]: 34: Hoare triple {599#false} #res := ~ret~0[32:0]; {599#false} is VALID [2018-11-14 17:54:26,272 INFO L273 TraceCheckUtils]: 35: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:54:26,273 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {599#false} {599#false} #77#return; {599#false} is VALID [2018-11-14 17:54:26,273 INFO L273 TraceCheckUtils]: 37: Hoare triple {599#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {599#false} is VALID [2018-11-14 17:54:26,273 INFO L273 TraceCheckUtils]: 38: Hoare triple {599#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {599#false} is VALID [2018-11-14 17:54:26,274 INFO L273 TraceCheckUtils]: 39: Hoare triple {599#false} assume !false; {599#false} is VALID [2018-11-14 17:54:26,277 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:54:26,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:54:26,544 INFO L273 TraceCheckUtils]: 39: Hoare triple {599#false} assume !false; {599#false} is VALID [2018-11-14 17:54:26,545 INFO L273 TraceCheckUtils]: 38: Hoare triple {599#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {599#false} is VALID [2018-11-14 17:54:26,545 INFO L273 TraceCheckUtils]: 37: Hoare triple {599#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {599#false} is VALID [2018-11-14 17:54:26,545 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {598#true} {599#false} #77#return; {599#false} is VALID [2018-11-14 17:54:26,546 INFO L273 TraceCheckUtils]: 35: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:54:26,546 INFO L273 TraceCheckUtils]: 34: Hoare triple {598#true} #res := ~ret~0[32:0]; {598#true} is VALID [2018-11-14 17:54:26,546 INFO L273 TraceCheckUtils]: 33: Hoare triple {598#true} assume !~bvslt32(~i~0, 40bv32); {598#true} is VALID [2018-11-14 17:54:26,547 INFO L273 TraceCheckUtils]: 32: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:54:26,547 INFO L273 TraceCheckUtils]: 31: Hoare triple {598#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {598#true} is VALID [2018-11-14 17:54:26,547 INFO L256 TraceCheckUtils]: 30: Hoare triple {599#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {598#true} is VALID [2018-11-14 17:54:26,547 INFO L273 TraceCheckUtils]: 29: Hoare triple {599#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(156bv32, ~#x~0.offset), 4bv32); {599#false} is VALID [2018-11-14 17:54:26,548 INFO L273 TraceCheckUtils]: 28: Hoare triple {599#false} assume !~bvslt32(~i~2, 39bv32); {599#false} is VALID [2018-11-14 17:54:26,548 INFO L273 TraceCheckUtils]: 27: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:54:26,548 INFO L273 TraceCheckUtils]: 26: Hoare triple {599#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {599#false} is VALID [2018-11-14 17:54:26,548 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {598#true} {599#false} #75#return; {599#false} is VALID [2018-11-14 17:54:26,549 INFO L273 TraceCheckUtils]: 24: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:54:26,549 INFO L273 TraceCheckUtils]: 23: Hoare triple {598#true} #res := ~ret~0[32:0]; {598#true} is VALID [2018-11-14 17:54:26,549 INFO L273 TraceCheckUtils]: 22: Hoare triple {598#true} assume !~bvslt32(~i~0, 40bv32); {598#true} is VALID [2018-11-14 17:54:26,550 INFO L273 TraceCheckUtils]: 21: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:54:26,550 INFO L273 TraceCheckUtils]: 20: Hoare triple {598#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {598#true} is VALID [2018-11-14 17:54:26,550 INFO L256 TraceCheckUtils]: 19: Hoare triple {599#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {598#true} is VALID [2018-11-14 17:54:26,551 INFO L273 TraceCheckUtils]: 18: Hoare triple {599#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {599#false} is VALID [2018-11-14 17:54:26,551 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {598#true} {599#false} #73#return; {599#false} is VALID [2018-11-14 17:54:26,551 INFO L273 TraceCheckUtils]: 16: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:54:26,552 INFO L273 TraceCheckUtils]: 15: Hoare triple {598#true} #res := ~ret~0[32:0]; {598#true} is VALID [2018-11-14 17:54:26,552 INFO L273 TraceCheckUtils]: 14: Hoare triple {598#true} assume !~bvslt32(~i~0, 40bv32); {598#true} is VALID [2018-11-14 17:54:26,552 INFO L273 TraceCheckUtils]: 13: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:54:26,553 INFO L273 TraceCheckUtils]: 12: Hoare triple {598#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {598#true} is VALID [2018-11-14 17:54:26,553 INFO L256 TraceCheckUtils]: 11: Hoare triple {599#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {598#true} is VALID [2018-11-14 17:54:26,569 INFO L273 TraceCheckUtils]: 10: Hoare triple {809#(bvslt main_~i~1 (_ bv40 32))} assume !~bvslt32(~i~1, 40bv32); {599#false} is VALID [2018-11-14 17:54:26,571 INFO L273 TraceCheckUtils]: 9: Hoare triple {809#(bvslt main_~i~1 (_ bv40 32))} assume true; {809#(bvslt main_~i~1 (_ bv40 32))} is VALID [2018-11-14 17:54:26,572 INFO L273 TraceCheckUtils]: 8: Hoare triple {816#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {809#(bvslt main_~i~1 (_ bv40 32))} is VALID [2018-11-14 17:54:26,579 INFO L273 TraceCheckUtils]: 7: Hoare triple {816#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {816#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:26,580 INFO L273 TraceCheckUtils]: 6: Hoare triple {816#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} assume true; {816#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:26,582 INFO L273 TraceCheckUtils]: 5: Hoare triple {598#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(160bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {816#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:26,583 INFO L256 TraceCheckUtils]: 4: Hoare triple {598#true} call #t~ret12 := main(); {598#true} is VALID [2018-11-14 17:54:26,583 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {598#true} {598#true} #69#return; {598#true} is VALID [2018-11-14 17:54:26,583 INFO L273 TraceCheckUtils]: 2: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:54:26,583 INFO L273 TraceCheckUtils]: 1: Hoare triple {598#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {598#true} is VALID [2018-11-14 17:54:26,584 INFO L256 TraceCheckUtils]: 0: Hoare triple {598#true} call ULTIMATE.init(); {598#true} is VALID [2018-11-14 17:54:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:54:26,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:54:26,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 17:54:26,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-14 17:54:26,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:54:26,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:54:26,717 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-14 17:54:26,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:54:26,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:54:26,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:54:26,719 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-11-14 17:54:27,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:27,021 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-11-14 17:54:27,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:54:27,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-14 17:54:27,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:54:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:54:27,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2018-11-14 17:54:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:54:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2018-11-14 17:54:27,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2018-11-14 17:54:27,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:54:27,160 INFO L225 Difference]: With dead ends: 60 [2018-11-14 17:54:27,160 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 17:54:27,161 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:54:27,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 17:54:27,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-14 17:54:27,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:54:27,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-14 17:54:27,184 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 17:54:27,184 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 17:54:27,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:27,188 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-14 17:54:27,188 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 17:54:27,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:54:27,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:54:27,192 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 17:54:27,192 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 17:54:27,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:27,196 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-14 17:54:27,196 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 17:54:27,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:54:27,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:54:27,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:54:27,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:54:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 17:54:27,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-14 17:54:27,201 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 40 [2018-11-14 17:54:27,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:54:27,201 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-14 17:54:27,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:54:27,201 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 17:54:27,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 17:54:27,203 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:54:27,203 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:54:27,203 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:54:27,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:54:27,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1973697456, now seen corresponding path program 2 times [2018-11-14 17:54:27,205 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:54:27,205 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-14 17:54:27,226 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 17:54:27,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 17:54:27,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:54:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:54:27,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:54:27,373 INFO L256 TraceCheckUtils]: 0: Hoare triple {1061#true} call ULTIMATE.init(); {1061#true} is VALID [2018-11-14 17:54:27,373 INFO L273 TraceCheckUtils]: 1: Hoare triple {1061#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1061#true} is VALID [2018-11-14 17:54:27,373 INFO L273 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:54:27,375 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #69#return; {1061#true} is VALID [2018-11-14 17:54:27,375 INFO L256 TraceCheckUtils]: 4: Hoare triple {1061#true} call #t~ret12 := main(); {1061#true} is VALID [2018-11-14 17:54:27,376 INFO L273 TraceCheckUtils]: 5: Hoare triple {1061#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(160bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {1061#true} is VALID [2018-11-14 17:54:27,376 INFO L273 TraceCheckUtils]: 6: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:54:27,377 INFO L273 TraceCheckUtils]: 7: Hoare triple {1061#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1061#true} is VALID [2018-11-14 17:54:27,377 INFO L273 TraceCheckUtils]: 8: Hoare triple {1061#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1061#true} is VALID [2018-11-14 17:54:27,378 INFO L273 TraceCheckUtils]: 9: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:54:27,378 INFO L273 TraceCheckUtils]: 10: Hoare triple {1061#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1061#true} is VALID [2018-11-14 17:54:27,378 INFO L273 TraceCheckUtils]: 11: Hoare triple {1061#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1061#true} is VALID [2018-11-14 17:54:27,379 INFO L273 TraceCheckUtils]: 12: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:54:27,379 INFO L273 TraceCheckUtils]: 13: Hoare triple {1061#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1061#true} is VALID [2018-11-14 17:54:27,379 INFO L273 TraceCheckUtils]: 14: Hoare triple {1061#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1061#true} is VALID [2018-11-14 17:54:27,379 INFO L273 TraceCheckUtils]: 15: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:54:27,380 INFO L273 TraceCheckUtils]: 16: Hoare triple {1061#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1061#true} is VALID [2018-11-14 17:54:27,380 INFO L273 TraceCheckUtils]: 17: Hoare triple {1061#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1061#true} is VALID [2018-11-14 17:54:27,380 INFO L273 TraceCheckUtils]: 18: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:54:27,380 INFO L273 TraceCheckUtils]: 19: Hoare triple {1061#true} assume !~bvslt32(~i~1, 40bv32); {1061#true} is VALID [2018-11-14 17:54:27,380 INFO L256 TraceCheckUtils]: 20: Hoare triple {1061#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {1061#true} is VALID [2018-11-14 17:54:27,381 INFO L273 TraceCheckUtils]: 21: Hoare triple {1061#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1061#true} is VALID [2018-11-14 17:54:27,381 INFO L273 TraceCheckUtils]: 22: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:54:27,381 INFO L273 TraceCheckUtils]: 23: Hoare triple {1061#true} assume !~bvslt32(~i~0, 40bv32); {1061#true} is VALID [2018-11-14 17:54:27,381 INFO L273 TraceCheckUtils]: 24: Hoare triple {1061#true} #res := ~ret~0[32:0]; {1061#true} is VALID [2018-11-14 17:54:27,382 INFO L273 TraceCheckUtils]: 25: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:54:27,382 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1061#true} {1061#true} #73#return; {1061#true} is VALID [2018-11-14 17:54:27,382 INFO L273 TraceCheckUtils]: 27: Hoare triple {1061#true} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1061#true} is VALID [2018-11-14 17:54:27,382 INFO L256 TraceCheckUtils]: 28: Hoare triple {1061#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {1061#true} is VALID [2018-11-14 17:54:27,383 INFO L273 TraceCheckUtils]: 29: Hoare triple {1061#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1061#true} is VALID [2018-11-14 17:54:27,383 INFO L273 TraceCheckUtils]: 30: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:54:27,383 INFO L273 TraceCheckUtils]: 31: Hoare triple {1061#true} assume !~bvslt32(~i~0, 40bv32); {1061#true} is VALID [2018-11-14 17:54:27,383 INFO L273 TraceCheckUtils]: 32: Hoare triple {1061#true} #res := ~ret~0[32:0]; {1061#true} is VALID [2018-11-14 17:54:27,384 INFO L273 TraceCheckUtils]: 33: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:54:27,384 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1061#true} {1061#true} #75#return; {1061#true} is VALID [2018-11-14 17:54:27,384 INFO L273 TraceCheckUtils]: 35: Hoare triple {1061#true} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {1061#true} is VALID [2018-11-14 17:54:27,384 INFO L273 TraceCheckUtils]: 36: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:54:27,385 INFO L273 TraceCheckUtils]: 37: Hoare triple {1061#true} assume !~bvslt32(~i~2, 39bv32); {1061#true} is VALID [2018-11-14 17:54:27,385 INFO L273 TraceCheckUtils]: 38: Hoare triple {1061#true} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(156bv32, ~#x~0.offset), 4bv32); {1061#true} is VALID [2018-11-14 17:54:27,385 INFO L256 TraceCheckUtils]: 39: Hoare triple {1061#true} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {1061#true} is VALID [2018-11-14 17:54:27,387 INFO L273 TraceCheckUtils]: 40: Hoare triple {1061#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1186#(= sum_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:54:27,391 INFO L273 TraceCheckUtils]: 41: Hoare triple {1186#(= sum_~i~0 (_ bv0 32))} assume true; {1186#(= sum_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:54:27,392 INFO L273 TraceCheckUtils]: 42: Hoare triple {1186#(= sum_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 40bv32); {1062#false} is VALID [2018-11-14 17:54:27,392 INFO L273 TraceCheckUtils]: 43: Hoare triple {1062#false} #res := ~ret~0[32:0]; {1062#false} is VALID [2018-11-14 17:54:27,392 INFO L273 TraceCheckUtils]: 44: Hoare triple {1062#false} assume true; {1062#false} is VALID [2018-11-14 17:54:27,393 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1062#false} {1061#true} #77#return; {1062#false} is VALID [2018-11-14 17:54:27,393 INFO L273 TraceCheckUtils]: 46: Hoare triple {1062#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {1062#false} is VALID [2018-11-14 17:54:27,393 INFO L273 TraceCheckUtils]: 47: Hoare triple {1062#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1062#false} is VALID [2018-11-14 17:54:27,393 INFO L273 TraceCheckUtils]: 48: Hoare triple {1062#false} assume !false; {1062#false} is VALID [2018-11-14 17:54:27,397 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-14 17:54:27,398 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:54:27,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:54:27,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:54:27,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-14 17:54:27,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:54:27,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:54:27,487 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-14 17:54:27,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:54:27,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:54:27,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:54:27,489 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 3 states. [2018-11-14 17:54:27,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:27,631 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2018-11-14 17:54:27,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:54:27,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-14 17:54:27,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:54:27,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:54:27,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 17:54:27,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:54:27,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 17:54:27,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-14 17:54:27,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:54:27,850 INFO L225 Difference]: With dead ends: 62 [2018-11-14 17:54:27,850 INFO L226 Difference]: Without dead ends: 43 [2018-11-14 17:54:27,851 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-14 17:54:27,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-14 17:54:27,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-14 17:54:27,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:54:27,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2018-11-14 17:54:27,884 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2018-11-14 17:54:27,885 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2018-11-14 17:54:27,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:27,888 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-14 17:54:27,888 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-14 17:54:27,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:54:27,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:54:27,889 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2018-11-14 17:54:27,889 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2018-11-14 17:54:27,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:27,892 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-14 17:54:27,892 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-14 17:54:27,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:54:27,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:54:27,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:54:27,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:54:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 17:54:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-14 17:54:27,896 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 49 [2018-11-14 17:54:27,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:54:27,897 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-14 17:54:27,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:54:27,897 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 17:54:27,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-14 17:54:27,899 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:54:27,899 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:54:27,899 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:54:27,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:54:27,899 INFO L82 PathProgramCache]: Analyzing trace with hash -189619867, now seen corresponding path program 1 times [2018-11-14 17:54:27,900 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:54:27,900 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-14 17:54:27,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:54:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:54:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:54:28,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:54:28,199 INFO L256 TraceCheckUtils]: 0: Hoare triple {1437#true} call ULTIMATE.init(); {1437#true} is VALID [2018-11-14 17:54:28,200 INFO L273 TraceCheckUtils]: 1: Hoare triple {1437#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1437#true} is VALID [2018-11-14 17:54:28,200 INFO L273 TraceCheckUtils]: 2: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:54:28,200 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1437#true} {1437#true} #69#return; {1437#true} is VALID [2018-11-14 17:54:28,200 INFO L256 TraceCheckUtils]: 4: Hoare triple {1437#true} call #t~ret12 := main(); {1437#true} is VALID [2018-11-14 17:54:28,207 INFO L273 TraceCheckUtils]: 5: Hoare triple {1437#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(160bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {1457#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:54:28,207 INFO L273 TraceCheckUtils]: 6: Hoare triple {1457#(= main_~i~1 (_ bv0 32))} assume true; {1457#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:54:28,208 INFO L273 TraceCheckUtils]: 7: Hoare triple {1457#(= main_~i~1 (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1457#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:54:28,209 INFO L273 TraceCheckUtils]: 8: Hoare triple {1457#(= main_~i~1 (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1467#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:28,209 INFO L273 TraceCheckUtils]: 9: Hoare triple {1467#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1467#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:28,210 INFO L273 TraceCheckUtils]: 10: Hoare triple {1467#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1467#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:28,210 INFO L273 TraceCheckUtils]: 11: Hoare triple {1467#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1477#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:28,211 INFO L273 TraceCheckUtils]: 12: Hoare triple {1477#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {1477#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:28,211 INFO L273 TraceCheckUtils]: 13: Hoare triple {1477#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1477#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:28,213 INFO L273 TraceCheckUtils]: 14: Hoare triple {1477#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1487#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:28,214 INFO L273 TraceCheckUtils]: 15: Hoare triple {1487#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1487#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:28,214 INFO L273 TraceCheckUtils]: 16: Hoare triple {1487#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1487#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:28,216 INFO L273 TraceCheckUtils]: 17: Hoare triple {1487#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1497#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:28,216 INFO L273 TraceCheckUtils]: 18: Hoare triple {1497#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} assume true; {1497#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:28,217 INFO L273 TraceCheckUtils]: 19: Hoare triple {1497#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~1, 40bv32); {1438#false} is VALID [2018-11-14 17:54:28,218 INFO L256 TraceCheckUtils]: 20: Hoare triple {1438#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {1438#false} is VALID [2018-11-14 17:54:28,218 INFO L273 TraceCheckUtils]: 21: Hoare triple {1438#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1438#false} is VALID [2018-11-14 17:54:28,218 INFO L273 TraceCheckUtils]: 22: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:54:28,219 INFO L273 TraceCheckUtils]: 23: Hoare triple {1438#false} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1438#false} is VALID [2018-11-14 17:54:28,219 INFO L273 TraceCheckUtils]: 24: Hoare triple {1438#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1438#false} is VALID [2018-11-14 17:54:28,220 INFO L273 TraceCheckUtils]: 25: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:54:28,220 INFO L273 TraceCheckUtils]: 26: Hoare triple {1438#false} assume !~bvslt32(~i~0, 40bv32); {1438#false} is VALID [2018-11-14 17:54:28,221 INFO L273 TraceCheckUtils]: 27: Hoare triple {1438#false} #res := ~ret~0[32:0]; {1438#false} is VALID [2018-11-14 17:54:28,221 INFO L273 TraceCheckUtils]: 28: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:54:28,222 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1438#false} {1438#false} #73#return; {1438#false} is VALID [2018-11-14 17:54:28,222 INFO L273 TraceCheckUtils]: 30: Hoare triple {1438#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1438#false} is VALID [2018-11-14 17:54:28,222 INFO L256 TraceCheckUtils]: 31: Hoare triple {1438#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {1438#false} is VALID [2018-11-14 17:54:28,223 INFO L273 TraceCheckUtils]: 32: Hoare triple {1438#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1438#false} is VALID [2018-11-14 17:54:28,223 INFO L273 TraceCheckUtils]: 33: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:54:28,223 INFO L273 TraceCheckUtils]: 34: Hoare triple {1438#false} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1438#false} is VALID [2018-11-14 17:54:28,224 INFO L273 TraceCheckUtils]: 35: Hoare triple {1438#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1438#false} is VALID [2018-11-14 17:54:28,224 INFO L273 TraceCheckUtils]: 36: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:54:28,224 INFO L273 TraceCheckUtils]: 37: Hoare triple {1438#false} assume !~bvslt32(~i~0, 40bv32); {1438#false} is VALID [2018-11-14 17:54:28,224 INFO L273 TraceCheckUtils]: 38: Hoare triple {1438#false} #res := ~ret~0[32:0]; {1438#false} is VALID [2018-11-14 17:54:28,225 INFO L273 TraceCheckUtils]: 39: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:54:28,225 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1438#false} {1438#false} #75#return; {1438#false} is VALID [2018-11-14 17:54:28,225 INFO L273 TraceCheckUtils]: 41: Hoare triple {1438#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {1438#false} is VALID [2018-11-14 17:54:28,225 INFO L273 TraceCheckUtils]: 42: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:54:28,225 INFO L273 TraceCheckUtils]: 43: Hoare triple {1438#false} assume !~bvslt32(~i~2, 39bv32); {1438#false} is VALID [2018-11-14 17:54:28,226 INFO L273 TraceCheckUtils]: 44: Hoare triple {1438#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(156bv32, ~#x~0.offset), 4bv32); {1438#false} is VALID [2018-11-14 17:54:28,226 INFO L256 TraceCheckUtils]: 45: Hoare triple {1438#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {1438#false} is VALID [2018-11-14 17:54:28,226 INFO L273 TraceCheckUtils]: 46: Hoare triple {1438#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1438#false} is VALID [2018-11-14 17:54:28,226 INFO L273 TraceCheckUtils]: 47: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:54:28,226 INFO L273 TraceCheckUtils]: 48: Hoare triple {1438#false} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1438#false} is VALID [2018-11-14 17:54:28,227 INFO L273 TraceCheckUtils]: 49: Hoare triple {1438#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1438#false} is VALID [2018-11-14 17:54:28,227 INFO L273 TraceCheckUtils]: 50: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:54:28,227 INFO L273 TraceCheckUtils]: 51: Hoare triple {1438#false} assume !~bvslt32(~i~0, 40bv32); {1438#false} is VALID [2018-11-14 17:54:28,227 INFO L273 TraceCheckUtils]: 52: Hoare triple {1438#false} #res := ~ret~0[32:0]; {1438#false} is VALID [2018-11-14 17:54:28,227 INFO L273 TraceCheckUtils]: 53: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:54:28,227 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1438#false} {1438#false} #77#return; {1438#false} is VALID [2018-11-14 17:54:28,228 INFO L273 TraceCheckUtils]: 55: Hoare triple {1438#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {1438#false} is VALID [2018-11-14 17:54:28,228 INFO L273 TraceCheckUtils]: 56: Hoare triple {1438#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1438#false} is VALID [2018-11-14 17:54:28,228 INFO L273 TraceCheckUtils]: 57: Hoare triple {1438#false} assume !false; {1438#false} is VALID [2018-11-14 17:54:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-14 17:54:28,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:54:28,573 INFO L273 TraceCheckUtils]: 57: Hoare triple {1438#false} assume !false; {1438#false} is VALID [2018-11-14 17:54:28,573 INFO L273 TraceCheckUtils]: 56: Hoare triple {1438#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1438#false} is VALID [2018-11-14 17:54:28,574 INFO L273 TraceCheckUtils]: 55: Hoare triple {1438#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {1438#false} is VALID [2018-11-14 17:54:28,574 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1437#true} {1438#false} #77#return; {1438#false} is VALID [2018-11-14 17:54:28,575 INFO L273 TraceCheckUtils]: 53: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:54:28,575 INFO L273 TraceCheckUtils]: 52: Hoare triple {1437#true} #res := ~ret~0[32:0]; {1437#true} is VALID [2018-11-14 17:54:28,575 INFO L273 TraceCheckUtils]: 51: Hoare triple {1437#true} assume !~bvslt32(~i~0, 40bv32); {1437#true} is VALID [2018-11-14 17:54:28,575 INFO L273 TraceCheckUtils]: 50: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:54:28,576 INFO L273 TraceCheckUtils]: 49: Hoare triple {1437#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1437#true} is VALID [2018-11-14 17:54:28,576 INFO L273 TraceCheckUtils]: 48: Hoare triple {1437#true} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1437#true} is VALID [2018-11-14 17:54:28,576 INFO L273 TraceCheckUtils]: 47: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:54:28,576 INFO L273 TraceCheckUtils]: 46: Hoare triple {1437#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1437#true} is VALID [2018-11-14 17:54:28,577 INFO L256 TraceCheckUtils]: 45: Hoare triple {1438#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {1437#true} is VALID [2018-11-14 17:54:28,577 INFO L273 TraceCheckUtils]: 44: Hoare triple {1438#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(156bv32, ~#x~0.offset), 4bv32); {1438#false} is VALID [2018-11-14 17:54:28,577 INFO L273 TraceCheckUtils]: 43: Hoare triple {1438#false} assume !~bvslt32(~i~2, 39bv32); {1438#false} is VALID [2018-11-14 17:54:28,577 INFO L273 TraceCheckUtils]: 42: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:54:28,578 INFO L273 TraceCheckUtils]: 41: Hoare triple {1438#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {1438#false} is VALID [2018-11-14 17:54:28,578 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1437#true} {1438#false} #75#return; {1438#false} is VALID [2018-11-14 17:54:28,578 INFO L273 TraceCheckUtils]: 39: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:54:28,578 INFO L273 TraceCheckUtils]: 38: Hoare triple {1437#true} #res := ~ret~0[32:0]; {1437#true} is VALID [2018-11-14 17:54:28,579 INFO L273 TraceCheckUtils]: 37: Hoare triple {1437#true} assume !~bvslt32(~i~0, 40bv32); {1437#true} is VALID [2018-11-14 17:54:28,579 INFO L273 TraceCheckUtils]: 36: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:54:28,579 INFO L273 TraceCheckUtils]: 35: Hoare triple {1437#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1437#true} is VALID [2018-11-14 17:54:28,580 INFO L273 TraceCheckUtils]: 34: Hoare triple {1437#true} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1437#true} is VALID [2018-11-14 17:54:28,580 INFO L273 TraceCheckUtils]: 33: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:54:28,580 INFO L273 TraceCheckUtils]: 32: Hoare triple {1437#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1437#true} is VALID [2018-11-14 17:54:28,580 INFO L256 TraceCheckUtils]: 31: Hoare triple {1438#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {1437#true} is VALID [2018-11-14 17:54:28,581 INFO L273 TraceCheckUtils]: 30: Hoare triple {1438#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1438#false} is VALID [2018-11-14 17:54:28,581 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1437#true} {1438#false} #73#return; {1438#false} is VALID [2018-11-14 17:54:28,581 INFO L273 TraceCheckUtils]: 28: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:54:28,581 INFO L273 TraceCheckUtils]: 27: Hoare triple {1437#true} #res := ~ret~0[32:0]; {1437#true} is VALID [2018-11-14 17:54:28,582 INFO L273 TraceCheckUtils]: 26: Hoare triple {1437#true} assume !~bvslt32(~i~0, 40bv32); {1437#true} is VALID [2018-11-14 17:54:28,582 INFO L273 TraceCheckUtils]: 25: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:54:28,582 INFO L273 TraceCheckUtils]: 24: Hoare triple {1437#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1437#true} is VALID [2018-11-14 17:54:28,582 INFO L273 TraceCheckUtils]: 23: Hoare triple {1437#true} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1437#true} is VALID [2018-11-14 17:54:28,583 INFO L273 TraceCheckUtils]: 22: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:54:28,583 INFO L273 TraceCheckUtils]: 21: Hoare triple {1437#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1437#true} is VALID [2018-11-14 17:54:28,583 INFO L256 TraceCheckUtils]: 20: Hoare triple {1438#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {1437#true} is VALID [2018-11-14 17:54:28,599 INFO L273 TraceCheckUtils]: 19: Hoare triple {1732#(bvslt main_~i~1 (_ bv40 32))} assume !~bvslt32(~i~1, 40bv32); {1438#false} is VALID [2018-11-14 17:54:28,615 INFO L273 TraceCheckUtils]: 18: Hoare triple {1732#(bvslt main_~i~1 (_ bv40 32))} assume true; {1732#(bvslt main_~i~1 (_ bv40 32))} is VALID [2018-11-14 17:54:28,617 INFO L273 TraceCheckUtils]: 17: Hoare triple {1739#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1732#(bvslt main_~i~1 (_ bv40 32))} is VALID [2018-11-14 17:54:28,618 INFO L273 TraceCheckUtils]: 16: Hoare triple {1739#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1739#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:28,618 INFO L273 TraceCheckUtils]: 15: Hoare triple {1739#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} assume true; {1739#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:28,621 INFO L273 TraceCheckUtils]: 14: Hoare triple {1749#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1739#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:28,622 INFO L273 TraceCheckUtils]: 13: Hoare triple {1749#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1749#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:28,626 INFO L273 TraceCheckUtils]: 12: Hoare triple {1749#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv40 32))} assume true; {1749#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:28,630 INFO L273 TraceCheckUtils]: 11: Hoare triple {1759#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1749#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:28,634 INFO L273 TraceCheckUtils]: 10: Hoare triple {1759#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1759#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:28,634 INFO L273 TraceCheckUtils]: 9: Hoare triple {1759#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv40 32))} assume true; {1759#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:28,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {1769#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1759#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:28,639 INFO L273 TraceCheckUtils]: 7: Hoare triple {1769#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1769#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:28,640 INFO L273 TraceCheckUtils]: 6: Hoare triple {1769#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv40 32))} assume true; {1769#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:28,640 INFO L273 TraceCheckUtils]: 5: Hoare triple {1437#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(160bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {1769#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:28,641 INFO L256 TraceCheckUtils]: 4: Hoare triple {1437#true} call #t~ret12 := main(); {1437#true} is VALID [2018-11-14 17:54:28,641 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1437#true} {1437#true} #69#return; {1437#true} is VALID [2018-11-14 17:54:28,641 INFO L273 TraceCheckUtils]: 2: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:54:28,641 INFO L273 TraceCheckUtils]: 1: Hoare triple {1437#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1437#true} is VALID [2018-11-14 17:54:28,641 INFO L256 TraceCheckUtils]: 0: Hoare triple {1437#true} call ULTIMATE.init(); {1437#true} is VALID [2018-11-14 17:54:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-14 17:54:28,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:54:28,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 17:54:28,649 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-11-14 17:54:28,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:54:28,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:54:28,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:54:28,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:54:28,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:54:28,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:54:28,785 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 12 states. [2018-11-14 17:54:29,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:29,795 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2018-11-14 17:54:29,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:54:29,795 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-11-14 17:54:29,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:54:29,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:54:29,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 91 transitions. [2018-11-14 17:54:29,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:54:29,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 91 transitions. [2018-11-14 17:54:29,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 91 transitions. [2018-11-14 17:54:30,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:54:30,016 INFO L225 Difference]: With dead ends: 82 [2018-11-14 17:54:30,016 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 17:54:30,017 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 105 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-14 17:54:30,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 17:54:30,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-14 17:54:30,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:54:30,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2018-11-14 17:54:30,045 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-14 17:54:30,045 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-14 17:54:30,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:30,048 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-11-14 17:54:30,048 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-14 17:54:30,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:54:30,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:54:30,049 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-14 17:54:30,049 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-14 17:54:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:30,052 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-11-14 17:54:30,052 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-14 17:54:30,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:54:30,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:54:30,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:54:30,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:54:30,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 17:54:30,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-14 17:54:30,056 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 58 [2018-11-14 17:54:30,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:54:30,057 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-14 17:54:30,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:54:30,057 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-14 17:54:30,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-14 17:54:30,059 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:54:30,059 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:54:30,060 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:54:30,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:54:30,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1278049627, now seen corresponding path program 2 times [2018-11-14 17:54:30,060 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:54:30,061 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-14 17:54:30,083 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 17:54:30,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:54:30,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:54:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:54:30,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:54:30,533 INFO L256 TraceCheckUtils]: 0: Hoare triple {2117#true} call ULTIMATE.init(); {2117#true} is VALID [2018-11-14 17:54:30,533 INFO L273 TraceCheckUtils]: 1: Hoare triple {2117#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2117#true} is VALID [2018-11-14 17:54:30,534 INFO L273 TraceCheckUtils]: 2: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 17:54:30,534 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2117#true} {2117#true} #69#return; {2117#true} is VALID [2018-11-14 17:54:30,534 INFO L256 TraceCheckUtils]: 4: Hoare triple {2117#true} call #t~ret12 := main(); {2117#true} is VALID [2018-11-14 17:54:30,534 INFO L273 TraceCheckUtils]: 5: Hoare triple {2117#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(160bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {2137#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:54:30,535 INFO L273 TraceCheckUtils]: 6: Hoare triple {2137#(= main_~i~1 (_ bv0 32))} assume true; {2137#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:54:30,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {2137#(= main_~i~1 (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2137#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:54:30,537 INFO L273 TraceCheckUtils]: 8: Hoare triple {2137#(= main_~i~1 (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2147#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:30,538 INFO L273 TraceCheckUtils]: 9: Hoare triple {2147#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2147#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:30,538 INFO L273 TraceCheckUtils]: 10: Hoare triple {2147#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2147#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:30,539 INFO L273 TraceCheckUtils]: 11: Hoare triple {2147#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2157#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:30,540 INFO L273 TraceCheckUtils]: 12: Hoare triple {2157#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2157#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:30,541 INFO L273 TraceCheckUtils]: 13: Hoare triple {2157#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2157#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:30,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {2157#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2167#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:30,543 INFO L273 TraceCheckUtils]: 15: Hoare triple {2167#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} assume true; {2167#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:30,544 INFO L273 TraceCheckUtils]: 16: Hoare triple {2167#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2167#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:30,546 INFO L273 TraceCheckUtils]: 17: Hoare triple {2167#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2177#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:30,547 INFO L273 TraceCheckUtils]: 18: Hoare triple {2177#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} assume true; {2177#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:30,548 INFO L273 TraceCheckUtils]: 19: Hoare triple {2177#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2177#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:30,549 INFO L273 TraceCheckUtils]: 20: Hoare triple {2177#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2187#(= (_ bv5 32) main_~i~1)} is VALID [2018-11-14 17:54:30,550 INFO L273 TraceCheckUtils]: 21: Hoare triple {2187#(= (_ bv5 32) main_~i~1)} assume true; {2187#(= (_ bv5 32) main_~i~1)} is VALID [2018-11-14 17:54:30,550 INFO L273 TraceCheckUtils]: 22: Hoare triple {2187#(= (_ bv5 32) main_~i~1)} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2187#(= (_ bv5 32) main_~i~1)} is VALID [2018-11-14 17:54:30,552 INFO L273 TraceCheckUtils]: 23: Hoare triple {2187#(= (_ bv5 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2197#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:30,552 INFO L273 TraceCheckUtils]: 24: Hoare triple {2197#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} assume true; {2197#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:30,553 INFO L273 TraceCheckUtils]: 25: Hoare triple {2197#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2197#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:30,554 INFO L273 TraceCheckUtils]: 26: Hoare triple {2197#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2207#(= (_ bv7 32) main_~i~1)} is VALID [2018-11-14 17:54:30,555 INFO L273 TraceCheckUtils]: 27: Hoare triple {2207#(= (_ bv7 32) main_~i~1)} assume true; {2207#(= (_ bv7 32) main_~i~1)} is VALID [2018-11-14 17:54:30,575 INFO L273 TraceCheckUtils]: 28: Hoare triple {2207#(= (_ bv7 32) main_~i~1)} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2207#(= (_ bv7 32) main_~i~1)} is VALID [2018-11-14 17:54:30,590 INFO L273 TraceCheckUtils]: 29: Hoare triple {2207#(= (_ bv7 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2217#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:30,593 INFO L273 TraceCheckUtils]: 30: Hoare triple {2217#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} assume true; {2217#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:30,594 INFO L273 TraceCheckUtils]: 31: Hoare triple {2217#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2217#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:30,595 INFO L273 TraceCheckUtils]: 32: Hoare triple {2217#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2227#(= (_ bv9 32) main_~i~1)} is VALID [2018-11-14 17:54:30,597 INFO L273 TraceCheckUtils]: 33: Hoare triple {2227#(= (_ bv9 32) main_~i~1)} assume true; {2227#(= (_ bv9 32) main_~i~1)} is VALID [2018-11-14 17:54:30,598 INFO L273 TraceCheckUtils]: 34: Hoare triple {2227#(= (_ bv9 32) main_~i~1)} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2227#(= (_ bv9 32) main_~i~1)} is VALID [2018-11-14 17:54:30,603 INFO L273 TraceCheckUtils]: 35: Hoare triple {2227#(= (_ bv9 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2237#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:30,604 INFO L273 TraceCheckUtils]: 36: Hoare triple {2237#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} assume true; {2237#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:30,605 INFO L273 TraceCheckUtils]: 37: Hoare triple {2237#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~1, 40bv32); {2118#false} is VALID [2018-11-14 17:54:30,605 INFO L256 TraceCheckUtils]: 38: Hoare triple {2118#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {2118#false} is VALID [2018-11-14 17:54:30,605 INFO L273 TraceCheckUtils]: 39: Hoare triple {2118#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {2118#false} is VALID [2018-11-14 17:54:30,605 INFO L273 TraceCheckUtils]: 40: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 17:54:30,606 INFO L273 TraceCheckUtils]: 41: Hoare triple {2118#false} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {2118#false} is VALID [2018-11-14 17:54:30,606 INFO L273 TraceCheckUtils]: 42: Hoare triple {2118#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2118#false} is VALID [2018-11-14 17:54:30,606 INFO L273 TraceCheckUtils]: 43: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 17:54:30,606 INFO L273 TraceCheckUtils]: 44: Hoare triple {2118#false} assume !~bvslt32(~i~0, 40bv32); {2118#false} is VALID [2018-11-14 17:54:30,607 INFO L273 TraceCheckUtils]: 45: Hoare triple {2118#false} #res := ~ret~0[32:0]; {2118#false} is VALID [2018-11-14 17:54:30,607 INFO L273 TraceCheckUtils]: 46: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 17:54:30,607 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {2118#false} {2118#false} #73#return; {2118#false} is VALID [2018-11-14 17:54:30,607 INFO L273 TraceCheckUtils]: 48: Hoare triple {2118#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {2118#false} is VALID [2018-11-14 17:54:30,608 INFO L256 TraceCheckUtils]: 49: Hoare triple {2118#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {2118#false} is VALID [2018-11-14 17:54:30,608 INFO L273 TraceCheckUtils]: 50: Hoare triple {2118#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {2118#false} is VALID [2018-11-14 17:54:30,608 INFO L273 TraceCheckUtils]: 51: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 17:54:30,608 INFO L273 TraceCheckUtils]: 52: Hoare triple {2118#false} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {2118#false} is VALID [2018-11-14 17:54:30,609 INFO L273 TraceCheckUtils]: 53: Hoare triple {2118#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2118#false} is VALID [2018-11-14 17:54:30,609 INFO L273 TraceCheckUtils]: 54: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 17:54:30,609 INFO L273 TraceCheckUtils]: 55: Hoare triple {2118#false} assume !~bvslt32(~i~0, 40bv32); {2118#false} is VALID [2018-11-14 17:54:30,609 INFO L273 TraceCheckUtils]: 56: Hoare triple {2118#false} #res := ~ret~0[32:0]; {2118#false} is VALID [2018-11-14 17:54:30,610 INFO L273 TraceCheckUtils]: 57: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 17:54:30,610 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {2118#false} {2118#false} #75#return; {2118#false} is VALID [2018-11-14 17:54:30,610 INFO L273 TraceCheckUtils]: 59: Hoare triple {2118#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {2118#false} is VALID [2018-11-14 17:54:30,610 INFO L273 TraceCheckUtils]: 60: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 17:54:30,611 INFO L273 TraceCheckUtils]: 61: Hoare triple {2118#false} assume !~bvslt32(~i~2, 39bv32); {2118#false} is VALID [2018-11-14 17:54:30,611 INFO L273 TraceCheckUtils]: 62: Hoare triple {2118#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(156bv32, ~#x~0.offset), 4bv32); {2118#false} is VALID [2018-11-14 17:54:30,611 INFO L256 TraceCheckUtils]: 63: Hoare triple {2118#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {2118#false} is VALID [2018-11-14 17:54:30,611 INFO L273 TraceCheckUtils]: 64: Hoare triple {2118#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {2118#false} is VALID [2018-11-14 17:54:30,612 INFO L273 TraceCheckUtils]: 65: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 17:54:30,612 INFO L273 TraceCheckUtils]: 66: Hoare triple {2118#false} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {2118#false} is VALID [2018-11-14 17:54:30,612 INFO L273 TraceCheckUtils]: 67: Hoare triple {2118#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2118#false} is VALID [2018-11-14 17:54:30,612 INFO L273 TraceCheckUtils]: 68: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 17:54:30,613 INFO L273 TraceCheckUtils]: 69: Hoare triple {2118#false} assume !~bvslt32(~i~0, 40bv32); {2118#false} is VALID [2018-11-14 17:54:30,613 INFO L273 TraceCheckUtils]: 70: Hoare triple {2118#false} #res := ~ret~0[32:0]; {2118#false} is VALID [2018-11-14 17:54:30,613 INFO L273 TraceCheckUtils]: 71: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 17:54:30,613 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {2118#false} {2118#false} #77#return; {2118#false} is VALID [2018-11-14 17:54:30,614 INFO L273 TraceCheckUtils]: 73: Hoare triple {2118#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {2118#false} is VALID [2018-11-14 17:54:30,614 INFO L273 TraceCheckUtils]: 74: Hoare triple {2118#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2118#false} is VALID [2018-11-14 17:54:30,614 INFO L273 TraceCheckUtils]: 75: Hoare triple {2118#false} assume !false; {2118#false} is VALID [2018-11-14 17:54:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-14 17:54:30,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:54:31,591 INFO L273 TraceCheckUtils]: 75: Hoare triple {2118#false} assume !false; {2118#false} is VALID [2018-11-14 17:54:31,592 INFO L273 TraceCheckUtils]: 74: Hoare triple {2118#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2118#false} is VALID [2018-11-14 17:54:31,592 INFO L273 TraceCheckUtils]: 73: Hoare triple {2118#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {2118#false} is VALID [2018-11-14 17:54:31,592 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {2117#true} {2118#false} #77#return; {2118#false} is VALID [2018-11-14 17:54:31,592 INFO L273 TraceCheckUtils]: 71: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 17:54:31,593 INFO L273 TraceCheckUtils]: 70: Hoare triple {2117#true} #res := ~ret~0[32:0]; {2117#true} is VALID [2018-11-14 17:54:31,593 INFO L273 TraceCheckUtils]: 69: Hoare triple {2117#true} assume !~bvslt32(~i~0, 40bv32); {2117#true} is VALID [2018-11-14 17:54:31,593 INFO L273 TraceCheckUtils]: 68: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 17:54:31,593 INFO L273 TraceCheckUtils]: 67: Hoare triple {2117#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2117#true} is VALID [2018-11-14 17:54:31,593 INFO L273 TraceCheckUtils]: 66: Hoare triple {2117#true} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {2117#true} is VALID [2018-11-14 17:54:31,594 INFO L273 TraceCheckUtils]: 65: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 17:54:31,594 INFO L273 TraceCheckUtils]: 64: Hoare triple {2117#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {2117#true} is VALID [2018-11-14 17:54:31,594 INFO L256 TraceCheckUtils]: 63: Hoare triple {2118#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {2117#true} is VALID [2018-11-14 17:54:31,594 INFO L273 TraceCheckUtils]: 62: Hoare triple {2118#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(156bv32, ~#x~0.offset), 4bv32); {2118#false} is VALID [2018-11-14 17:54:31,594 INFO L273 TraceCheckUtils]: 61: Hoare triple {2118#false} assume !~bvslt32(~i~2, 39bv32); {2118#false} is VALID [2018-11-14 17:54:31,594 INFO L273 TraceCheckUtils]: 60: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 17:54:31,594 INFO L273 TraceCheckUtils]: 59: Hoare triple {2118#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {2118#false} is VALID [2018-11-14 17:54:31,595 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {2117#true} {2118#false} #75#return; {2118#false} is VALID [2018-11-14 17:54:31,595 INFO L273 TraceCheckUtils]: 57: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 17:54:31,595 INFO L273 TraceCheckUtils]: 56: Hoare triple {2117#true} #res := ~ret~0[32:0]; {2117#true} is VALID [2018-11-14 17:54:31,595 INFO L273 TraceCheckUtils]: 55: Hoare triple {2117#true} assume !~bvslt32(~i~0, 40bv32); {2117#true} is VALID [2018-11-14 17:54:31,595 INFO L273 TraceCheckUtils]: 54: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 17:54:31,595 INFO L273 TraceCheckUtils]: 53: Hoare triple {2117#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2117#true} is VALID [2018-11-14 17:54:31,596 INFO L273 TraceCheckUtils]: 52: Hoare triple {2117#true} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {2117#true} is VALID [2018-11-14 17:54:31,596 INFO L273 TraceCheckUtils]: 51: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 17:54:31,596 INFO L273 TraceCheckUtils]: 50: Hoare triple {2117#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {2117#true} is VALID [2018-11-14 17:54:31,596 INFO L256 TraceCheckUtils]: 49: Hoare triple {2118#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {2117#true} is VALID [2018-11-14 17:54:31,596 INFO L273 TraceCheckUtils]: 48: Hoare triple {2118#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {2118#false} is VALID [2018-11-14 17:54:31,597 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {2117#true} {2118#false} #73#return; {2118#false} is VALID [2018-11-14 17:54:31,597 INFO L273 TraceCheckUtils]: 46: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 17:54:31,597 INFO L273 TraceCheckUtils]: 45: Hoare triple {2117#true} #res := ~ret~0[32:0]; {2117#true} is VALID [2018-11-14 17:54:31,597 INFO L273 TraceCheckUtils]: 44: Hoare triple {2117#true} assume !~bvslt32(~i~0, 40bv32); {2117#true} is VALID [2018-11-14 17:54:31,597 INFO L273 TraceCheckUtils]: 43: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 17:54:31,598 INFO L273 TraceCheckUtils]: 42: Hoare triple {2117#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2117#true} is VALID [2018-11-14 17:54:31,598 INFO L273 TraceCheckUtils]: 41: Hoare triple {2117#true} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {2117#true} is VALID [2018-11-14 17:54:31,598 INFO L273 TraceCheckUtils]: 40: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 17:54:31,598 INFO L273 TraceCheckUtils]: 39: Hoare triple {2117#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {2117#true} is VALID [2018-11-14 17:54:31,598 INFO L256 TraceCheckUtils]: 38: Hoare triple {2118#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {2117#true} is VALID [2018-11-14 17:54:31,602 INFO L273 TraceCheckUtils]: 37: Hoare triple {2472#(bvslt main_~i~1 (_ bv40 32))} assume !~bvslt32(~i~1, 40bv32); {2118#false} is VALID [2018-11-14 17:54:31,602 INFO L273 TraceCheckUtils]: 36: Hoare triple {2472#(bvslt main_~i~1 (_ bv40 32))} assume true; {2472#(bvslt main_~i~1 (_ bv40 32))} is VALID [2018-11-14 17:54:31,603 INFO L273 TraceCheckUtils]: 35: Hoare triple {2479#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2472#(bvslt main_~i~1 (_ bv40 32))} is VALID [2018-11-14 17:54:31,603 INFO L273 TraceCheckUtils]: 34: Hoare triple {2479#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2479#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,603 INFO L273 TraceCheckUtils]: 33: Hoare triple {2479#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} assume true; {2479#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,607 INFO L273 TraceCheckUtils]: 32: Hoare triple {2489#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2479#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,608 INFO L273 TraceCheckUtils]: 31: Hoare triple {2489#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2489#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,608 INFO L273 TraceCheckUtils]: 30: Hoare triple {2489#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv40 32))} assume true; {2489#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,611 INFO L273 TraceCheckUtils]: 29: Hoare triple {2499#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2489#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,612 INFO L273 TraceCheckUtils]: 28: Hoare triple {2499#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2499#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,613 INFO L273 TraceCheckUtils]: 27: Hoare triple {2499#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv40 32))} assume true; {2499#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,616 INFO L273 TraceCheckUtils]: 26: Hoare triple {2509#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2499#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,617 INFO L273 TraceCheckUtils]: 25: Hoare triple {2509#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2509#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,617 INFO L273 TraceCheckUtils]: 24: Hoare triple {2509#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv40 32))} assume true; {2509#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,620 INFO L273 TraceCheckUtils]: 23: Hoare triple {2519#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2509#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,621 INFO L273 TraceCheckUtils]: 22: Hoare triple {2519#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2519#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,621 INFO L273 TraceCheckUtils]: 21: Hoare triple {2519#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv40 32))} assume true; {2519#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,625 INFO L273 TraceCheckUtils]: 20: Hoare triple {2529#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2519#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,626 INFO L273 TraceCheckUtils]: 19: Hoare triple {2529#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2529#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,626 INFO L273 TraceCheckUtils]: 18: Hoare triple {2529#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv40 32))} assume true; {2529#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,629 INFO L273 TraceCheckUtils]: 17: Hoare triple {2539#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2529#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,646 INFO L273 TraceCheckUtils]: 16: Hoare triple {2539#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2539#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,646 INFO L273 TraceCheckUtils]: 15: Hoare triple {2539#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv40 32))} assume true; {2539#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,650 INFO L273 TraceCheckUtils]: 14: Hoare triple {2549#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2539#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,651 INFO L273 TraceCheckUtils]: 13: Hoare triple {2549#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2549#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,651 INFO L273 TraceCheckUtils]: 12: Hoare triple {2549#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv40 32))} assume true; {2549#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,656 INFO L273 TraceCheckUtils]: 11: Hoare triple {2559#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2549#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,663 INFO L273 TraceCheckUtils]: 10: Hoare triple {2559#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2559#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,664 INFO L273 TraceCheckUtils]: 9: Hoare triple {2559#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv40 32))} assume true; {2559#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,667 INFO L273 TraceCheckUtils]: 8: Hoare triple {2569#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2559#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,668 INFO L273 TraceCheckUtils]: 7: Hoare triple {2569#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2569#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,669 INFO L273 TraceCheckUtils]: 6: Hoare triple {2569#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv40 32))} assume true; {2569#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,669 INFO L273 TraceCheckUtils]: 5: Hoare triple {2117#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(160bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {2569#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:31,669 INFO L256 TraceCheckUtils]: 4: Hoare triple {2117#true} call #t~ret12 := main(); {2117#true} is VALID [2018-11-14 17:54:31,670 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2117#true} {2117#true} #69#return; {2117#true} is VALID [2018-11-14 17:54:31,670 INFO L273 TraceCheckUtils]: 2: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 17:54:31,670 INFO L273 TraceCheckUtils]: 1: Hoare triple {2117#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2117#true} is VALID [2018-11-14 17:54:31,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {2117#true} call ULTIMATE.init(); {2117#true} is VALID [2018-11-14 17:54:31,674 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-14 17:54:31,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:54:31,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-14 17:54:31,677 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 76 [2018-11-14 17:54:31,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:54:31,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 17:54:31,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:54:31,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 17:54:31,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 17:54:31,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:54:31,869 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 24 states. [2018-11-14 17:54:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:35,599 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2018-11-14 17:54:35,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 17:54:35,599 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 76 [2018-11-14 17:54:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:54:35,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:54:35,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 133 transitions. [2018-11-14 17:54:35,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:54:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 133 transitions. [2018-11-14 17:54:35,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 133 transitions. [2018-11-14 17:54:35,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:54:35,866 INFO L225 Difference]: With dead ends: 118 [2018-11-14 17:54:35,866 INFO L226 Difference]: Without dead ends: 96 [2018-11-14 17:54:35,867 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:54:35,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-14 17:54:35,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-14 17:54:35,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:54:35,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 96 states. [2018-11-14 17:54:35,957 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-14 17:54:35,957 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-14 17:54:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:35,961 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-14 17:54:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-14 17:54:35,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:54:35,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:54:35,962 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-14 17:54:35,963 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-14 17:54:35,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:35,967 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-14 17:54:35,967 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-14 17:54:35,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:54:35,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:54:35,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:54:35,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:54:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-14 17:54:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-11-14 17:54:35,972 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 76 [2018-11-14 17:54:35,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:54:35,972 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-11-14 17:54:35,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 17:54:35,972 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-14 17:54:35,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-14 17:54:35,974 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:54:35,974 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:54:35,975 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:54:35,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:54:35,975 INFO L82 PathProgramCache]: Analyzing trace with hash -97725147, now seen corresponding path program 3 times [2018-11-14 17:54:35,976 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:54:35,976 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-14 17:54:35,998 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 17:54:36,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 17:54:36,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:54:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:54:36,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:54:36,278 INFO L256 TraceCheckUtils]: 0: Hoare triple {3097#true} call ULTIMATE.init(); {3097#true} is VALID [2018-11-14 17:54:36,279 INFO L273 TraceCheckUtils]: 1: Hoare triple {3097#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3097#true} is VALID [2018-11-14 17:54:36,279 INFO L273 TraceCheckUtils]: 2: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,279 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3097#true} {3097#true} #69#return; {3097#true} is VALID [2018-11-14 17:54:36,279 INFO L256 TraceCheckUtils]: 4: Hoare triple {3097#true} call #t~ret12 := main(); {3097#true} is VALID [2018-11-14 17:54:36,280 INFO L273 TraceCheckUtils]: 5: Hoare triple {3097#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(160bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {3097#true} is VALID [2018-11-14 17:54:36,280 INFO L273 TraceCheckUtils]: 6: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,280 INFO L273 TraceCheckUtils]: 7: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,280 INFO L273 TraceCheckUtils]: 8: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,281 INFO L273 TraceCheckUtils]: 9: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,281 INFO L273 TraceCheckUtils]: 10: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,281 INFO L273 TraceCheckUtils]: 11: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,281 INFO L273 TraceCheckUtils]: 12: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,281 INFO L273 TraceCheckUtils]: 13: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,281 INFO L273 TraceCheckUtils]: 14: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,281 INFO L273 TraceCheckUtils]: 15: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,282 INFO L273 TraceCheckUtils]: 16: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,282 INFO L273 TraceCheckUtils]: 17: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,282 INFO L273 TraceCheckUtils]: 18: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,282 INFO L273 TraceCheckUtils]: 19: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,282 INFO L273 TraceCheckUtils]: 20: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,283 INFO L273 TraceCheckUtils]: 21: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,283 INFO L273 TraceCheckUtils]: 22: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,283 INFO L273 TraceCheckUtils]: 23: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,283 INFO L273 TraceCheckUtils]: 24: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,283 INFO L273 TraceCheckUtils]: 25: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,283 INFO L273 TraceCheckUtils]: 26: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,284 INFO L273 TraceCheckUtils]: 27: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,284 INFO L273 TraceCheckUtils]: 28: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,284 INFO L273 TraceCheckUtils]: 29: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,284 INFO L273 TraceCheckUtils]: 30: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,284 INFO L273 TraceCheckUtils]: 31: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,284 INFO L273 TraceCheckUtils]: 32: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,285 INFO L273 TraceCheckUtils]: 33: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,285 INFO L273 TraceCheckUtils]: 34: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,285 INFO L273 TraceCheckUtils]: 35: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,285 INFO L273 TraceCheckUtils]: 36: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,285 INFO L273 TraceCheckUtils]: 37: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,286 INFO L273 TraceCheckUtils]: 38: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,286 INFO L273 TraceCheckUtils]: 39: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,286 INFO L273 TraceCheckUtils]: 40: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,286 INFO L273 TraceCheckUtils]: 41: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,286 INFO L273 TraceCheckUtils]: 42: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,287 INFO L273 TraceCheckUtils]: 43: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,287 INFO L273 TraceCheckUtils]: 44: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,287 INFO L273 TraceCheckUtils]: 45: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,287 INFO L273 TraceCheckUtils]: 46: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,287 INFO L273 TraceCheckUtils]: 47: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,288 INFO L273 TraceCheckUtils]: 48: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,288 INFO L273 TraceCheckUtils]: 49: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,288 INFO L273 TraceCheckUtils]: 50: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,288 INFO L273 TraceCheckUtils]: 51: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,288 INFO L273 TraceCheckUtils]: 52: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,289 INFO L273 TraceCheckUtils]: 53: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,289 INFO L273 TraceCheckUtils]: 54: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,289 INFO L273 TraceCheckUtils]: 55: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,289 INFO L273 TraceCheckUtils]: 56: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,289 INFO L273 TraceCheckUtils]: 57: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,290 INFO L273 TraceCheckUtils]: 58: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,290 INFO L273 TraceCheckUtils]: 59: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,290 INFO L273 TraceCheckUtils]: 60: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,290 INFO L273 TraceCheckUtils]: 61: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,290 INFO L273 TraceCheckUtils]: 62: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,291 INFO L273 TraceCheckUtils]: 63: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,291 INFO L273 TraceCheckUtils]: 64: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,291 INFO L273 TraceCheckUtils]: 65: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,291 INFO L273 TraceCheckUtils]: 66: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,291 INFO L273 TraceCheckUtils]: 67: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,292 INFO L273 TraceCheckUtils]: 68: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,292 INFO L273 TraceCheckUtils]: 69: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,292 INFO L273 TraceCheckUtils]: 70: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,292 INFO L273 TraceCheckUtils]: 71: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,292 INFO L273 TraceCheckUtils]: 72: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,292 INFO L273 TraceCheckUtils]: 73: Hoare triple {3097#true} assume !~bvslt32(~i~1, 40bv32); {3097#true} is VALID [2018-11-14 17:54:36,293 INFO L256 TraceCheckUtils]: 74: Hoare triple {3097#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {3097#true} is VALID [2018-11-14 17:54:36,293 INFO L273 TraceCheckUtils]: 75: Hoare triple {3097#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {3097#true} is VALID [2018-11-14 17:54:36,293 INFO L273 TraceCheckUtils]: 76: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,293 INFO L273 TraceCheckUtils]: 77: Hoare triple {3097#true} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {3097#true} is VALID [2018-11-14 17:54:36,293 INFO L273 TraceCheckUtils]: 78: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:54:36,293 INFO L273 TraceCheckUtils]: 79: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,294 INFO L273 TraceCheckUtils]: 80: Hoare triple {3097#true} assume !~bvslt32(~i~0, 40bv32); {3097#true} is VALID [2018-11-14 17:54:36,294 INFO L273 TraceCheckUtils]: 81: Hoare triple {3097#true} #res := ~ret~0[32:0]; {3097#true} is VALID [2018-11-14 17:54:36,294 INFO L273 TraceCheckUtils]: 82: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,294 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {3097#true} {3097#true} #73#return; {3097#true} is VALID [2018-11-14 17:54:36,294 INFO L273 TraceCheckUtils]: 84: Hoare triple {3097#true} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {3097#true} is VALID [2018-11-14 17:54:36,295 INFO L256 TraceCheckUtils]: 85: Hoare triple {3097#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {3097#true} is VALID [2018-11-14 17:54:36,295 INFO L273 TraceCheckUtils]: 86: Hoare triple {3097#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {3097#true} is VALID [2018-11-14 17:54:36,295 INFO L273 TraceCheckUtils]: 87: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,295 INFO L273 TraceCheckUtils]: 88: Hoare triple {3097#true} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {3097#true} is VALID [2018-11-14 17:54:36,295 INFO L273 TraceCheckUtils]: 89: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:54:36,295 INFO L273 TraceCheckUtils]: 90: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,296 INFO L273 TraceCheckUtils]: 91: Hoare triple {3097#true} assume !~bvslt32(~i~0, 40bv32); {3097#true} is VALID [2018-11-14 17:54:36,296 INFO L273 TraceCheckUtils]: 92: Hoare triple {3097#true} #res := ~ret~0[32:0]; {3097#true} is VALID [2018-11-14 17:54:36,296 INFO L273 TraceCheckUtils]: 93: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,296 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {3097#true} {3097#true} #75#return; {3097#true} is VALID [2018-11-14 17:54:36,296 INFO L273 TraceCheckUtils]: 95: Hoare triple {3097#true} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {3097#true} is VALID [2018-11-14 17:54:36,297 INFO L273 TraceCheckUtils]: 96: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,297 INFO L273 TraceCheckUtils]: 97: Hoare triple {3097#true} assume !~bvslt32(~i~2, 39bv32); {3097#true} is VALID [2018-11-14 17:54:36,297 INFO L273 TraceCheckUtils]: 98: Hoare triple {3097#true} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(156bv32, ~#x~0.offset), 4bv32); {3097#true} is VALID [2018-11-14 17:54:36,297 INFO L256 TraceCheckUtils]: 99: Hoare triple {3097#true} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {3097#true} is VALID [2018-11-14 17:54:36,302 INFO L273 TraceCheckUtils]: 100: Hoare triple {3097#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {3402#(= sum_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:54:36,303 INFO L273 TraceCheckUtils]: 101: Hoare triple {3402#(= sum_~i~0 (_ bv0 32))} assume true; {3402#(= sum_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:54:36,307 INFO L273 TraceCheckUtils]: 102: Hoare triple {3402#(= sum_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {3402#(= sum_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:54:36,307 INFO L273 TraceCheckUtils]: 103: Hoare triple {3402#(= sum_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3412#(= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:36,309 INFO L273 TraceCheckUtils]: 104: Hoare triple {3412#(= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3412#(= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:36,309 INFO L273 TraceCheckUtils]: 105: Hoare triple {3412#(= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 40bv32); {3098#false} is VALID [2018-11-14 17:54:36,309 INFO L273 TraceCheckUtils]: 106: Hoare triple {3098#false} #res := ~ret~0[32:0]; {3098#false} is VALID [2018-11-14 17:54:36,309 INFO L273 TraceCheckUtils]: 107: Hoare triple {3098#false} assume true; {3098#false} is VALID [2018-11-14 17:54:36,310 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {3098#false} {3097#true} #77#return; {3098#false} is VALID [2018-11-14 17:54:36,310 INFO L273 TraceCheckUtils]: 109: Hoare triple {3098#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {3098#false} is VALID [2018-11-14 17:54:36,310 INFO L273 TraceCheckUtils]: 110: Hoare triple {3098#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3098#false} is VALID [2018-11-14 17:54:36,310 INFO L273 TraceCheckUtils]: 111: Hoare triple {3098#false} assume !false; {3098#false} is VALID [2018-11-14 17:54:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-11-14 17:54:36,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:54:36,470 INFO L273 TraceCheckUtils]: 111: Hoare triple {3098#false} assume !false; {3098#false} is VALID [2018-11-14 17:54:36,470 INFO L273 TraceCheckUtils]: 110: Hoare triple {3098#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3098#false} is VALID [2018-11-14 17:54:36,470 INFO L273 TraceCheckUtils]: 109: Hoare triple {3098#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {3098#false} is VALID [2018-11-14 17:54:36,471 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {3098#false} {3097#true} #77#return; {3098#false} is VALID [2018-11-14 17:54:36,471 INFO L273 TraceCheckUtils]: 107: Hoare triple {3098#false} assume true; {3098#false} is VALID [2018-11-14 17:54:36,471 INFO L273 TraceCheckUtils]: 106: Hoare triple {3098#false} #res := ~ret~0[32:0]; {3098#false} is VALID [2018-11-14 17:54:36,488 INFO L273 TraceCheckUtils]: 105: Hoare triple {3458#(bvslt sum_~i~0 (_ bv40 32))} assume !~bvslt32(~i~0, 40bv32); {3098#false} is VALID [2018-11-14 17:54:36,489 INFO L273 TraceCheckUtils]: 104: Hoare triple {3458#(bvslt sum_~i~0 (_ bv40 32))} assume true; {3458#(bvslt sum_~i~0 (_ bv40 32))} is VALID [2018-11-14 17:54:36,495 INFO L273 TraceCheckUtils]: 103: Hoare triple {3465#(bvslt (bvadd sum_~i~0 (_ bv1 32)) (_ bv40 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3458#(bvslt sum_~i~0 (_ bv40 32))} is VALID [2018-11-14 17:54:36,495 INFO L273 TraceCheckUtils]: 102: Hoare triple {3465#(bvslt (bvadd sum_~i~0 (_ bv1 32)) (_ bv40 32))} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {3465#(bvslt (bvadd sum_~i~0 (_ bv1 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:36,496 INFO L273 TraceCheckUtils]: 101: Hoare triple {3465#(bvslt (bvadd sum_~i~0 (_ bv1 32)) (_ bv40 32))} assume true; {3465#(bvslt (bvadd sum_~i~0 (_ bv1 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:36,496 INFO L273 TraceCheckUtils]: 100: Hoare triple {3097#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {3465#(bvslt (bvadd sum_~i~0 (_ bv1 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:36,496 INFO L256 TraceCheckUtils]: 99: Hoare triple {3097#true} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {3097#true} is VALID [2018-11-14 17:54:36,496 INFO L273 TraceCheckUtils]: 98: Hoare triple {3097#true} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(156bv32, ~#x~0.offset), 4bv32); {3097#true} is VALID [2018-11-14 17:54:36,497 INFO L273 TraceCheckUtils]: 97: Hoare triple {3097#true} assume !~bvslt32(~i~2, 39bv32); {3097#true} is VALID [2018-11-14 17:54:36,497 INFO L273 TraceCheckUtils]: 96: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,497 INFO L273 TraceCheckUtils]: 95: Hoare triple {3097#true} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {3097#true} is VALID [2018-11-14 17:54:36,497 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {3097#true} {3097#true} #75#return; {3097#true} is VALID [2018-11-14 17:54:36,497 INFO L273 TraceCheckUtils]: 93: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,497 INFO L273 TraceCheckUtils]: 92: Hoare triple {3097#true} #res := ~ret~0[32:0]; {3097#true} is VALID [2018-11-14 17:54:36,497 INFO L273 TraceCheckUtils]: 91: Hoare triple {3097#true} assume !~bvslt32(~i~0, 40bv32); {3097#true} is VALID [2018-11-14 17:54:36,497 INFO L273 TraceCheckUtils]: 90: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,498 INFO L273 TraceCheckUtils]: 89: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:54:36,498 INFO L273 TraceCheckUtils]: 88: Hoare triple {3097#true} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {3097#true} is VALID [2018-11-14 17:54:36,498 INFO L273 TraceCheckUtils]: 87: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,498 INFO L273 TraceCheckUtils]: 86: Hoare triple {3097#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {3097#true} is VALID [2018-11-14 17:54:36,498 INFO L256 TraceCheckUtils]: 85: Hoare triple {3097#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {3097#true} is VALID [2018-11-14 17:54:36,498 INFO L273 TraceCheckUtils]: 84: Hoare triple {3097#true} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {3097#true} is VALID [2018-11-14 17:54:36,498 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {3097#true} {3097#true} #73#return; {3097#true} is VALID [2018-11-14 17:54:36,499 INFO L273 TraceCheckUtils]: 82: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,499 INFO L273 TraceCheckUtils]: 81: Hoare triple {3097#true} #res := ~ret~0[32:0]; {3097#true} is VALID [2018-11-14 17:54:36,499 INFO L273 TraceCheckUtils]: 80: Hoare triple {3097#true} assume !~bvslt32(~i~0, 40bv32); {3097#true} is VALID [2018-11-14 17:54:36,499 INFO L273 TraceCheckUtils]: 79: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,499 INFO L273 TraceCheckUtils]: 78: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:54:36,499 INFO L273 TraceCheckUtils]: 77: Hoare triple {3097#true} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {3097#true} is VALID [2018-11-14 17:54:36,499 INFO L273 TraceCheckUtils]: 76: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,499 INFO L273 TraceCheckUtils]: 75: Hoare triple {3097#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {3097#true} is VALID [2018-11-14 17:54:36,500 INFO L256 TraceCheckUtils]: 74: Hoare triple {3097#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {3097#true} is VALID [2018-11-14 17:54:36,500 INFO L273 TraceCheckUtils]: 73: Hoare triple {3097#true} assume !~bvslt32(~i~1, 40bv32); {3097#true} is VALID [2018-11-14 17:54:36,500 INFO L273 TraceCheckUtils]: 72: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,500 INFO L273 TraceCheckUtils]: 71: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,500 INFO L273 TraceCheckUtils]: 70: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,500 INFO L273 TraceCheckUtils]: 69: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,500 INFO L273 TraceCheckUtils]: 68: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,500 INFO L273 TraceCheckUtils]: 67: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,501 INFO L273 TraceCheckUtils]: 66: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,501 INFO L273 TraceCheckUtils]: 65: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,501 INFO L273 TraceCheckUtils]: 64: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,501 INFO L273 TraceCheckUtils]: 63: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,501 INFO L273 TraceCheckUtils]: 62: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,502 INFO L273 TraceCheckUtils]: 61: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,502 INFO L273 TraceCheckUtils]: 60: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,502 INFO L273 TraceCheckUtils]: 59: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,502 INFO L273 TraceCheckUtils]: 58: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,502 INFO L273 TraceCheckUtils]: 57: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,502 INFO L273 TraceCheckUtils]: 56: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,503 INFO L273 TraceCheckUtils]: 55: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,503 INFO L273 TraceCheckUtils]: 54: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,503 INFO L273 TraceCheckUtils]: 53: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,503 INFO L273 TraceCheckUtils]: 52: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,503 INFO L273 TraceCheckUtils]: 51: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,503 INFO L273 TraceCheckUtils]: 50: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,504 INFO L273 TraceCheckUtils]: 49: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,504 INFO L273 TraceCheckUtils]: 48: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,504 INFO L273 TraceCheckUtils]: 47: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,504 INFO L273 TraceCheckUtils]: 46: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,504 INFO L273 TraceCheckUtils]: 45: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,505 INFO L273 TraceCheckUtils]: 44: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,505 INFO L273 TraceCheckUtils]: 43: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,505 INFO L273 TraceCheckUtils]: 42: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,505 INFO L273 TraceCheckUtils]: 41: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,505 INFO L273 TraceCheckUtils]: 40: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,506 INFO L273 TraceCheckUtils]: 39: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,506 INFO L273 TraceCheckUtils]: 38: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,506 INFO L273 TraceCheckUtils]: 37: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,506 INFO L273 TraceCheckUtils]: 36: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,506 INFO L273 TraceCheckUtils]: 35: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,506 INFO L273 TraceCheckUtils]: 34: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,507 INFO L273 TraceCheckUtils]: 33: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,507 INFO L273 TraceCheckUtils]: 32: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,507 INFO L273 TraceCheckUtils]: 31: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,507 INFO L273 TraceCheckUtils]: 30: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,507 INFO L273 TraceCheckUtils]: 29: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,508 INFO L273 TraceCheckUtils]: 28: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,508 INFO L273 TraceCheckUtils]: 27: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,508 INFO L273 TraceCheckUtils]: 26: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,508 INFO L273 TraceCheckUtils]: 25: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,508 INFO L273 TraceCheckUtils]: 24: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,508 INFO L273 TraceCheckUtils]: 23: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,509 INFO L273 TraceCheckUtils]: 22: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,509 INFO L273 TraceCheckUtils]: 21: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,509 INFO L273 TraceCheckUtils]: 20: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,509 INFO L273 TraceCheckUtils]: 19: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,509 INFO L273 TraceCheckUtils]: 18: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,509 INFO L273 TraceCheckUtils]: 17: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,510 INFO L273 TraceCheckUtils]: 16: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,510 INFO L273 TraceCheckUtils]: 15: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,510 INFO L273 TraceCheckUtils]: 14: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,510 INFO L273 TraceCheckUtils]: 13: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,510 INFO L273 TraceCheckUtils]: 12: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,510 INFO L273 TraceCheckUtils]: 11: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,511 INFO L273 TraceCheckUtils]: 10: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,511 INFO L273 TraceCheckUtils]: 9: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 17:54:36,511 INFO L273 TraceCheckUtils]: 7: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 17:54:36,511 INFO L273 TraceCheckUtils]: 6: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,512 INFO L273 TraceCheckUtils]: 5: Hoare triple {3097#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(160bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {3097#true} is VALID [2018-11-14 17:54:36,512 INFO L256 TraceCheckUtils]: 4: Hoare triple {3097#true} call #t~ret12 := main(); {3097#true} is VALID [2018-11-14 17:54:36,512 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3097#true} {3097#true} #69#return; {3097#true} is VALID [2018-11-14 17:54:36,512 INFO L273 TraceCheckUtils]: 2: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:54:36,512 INFO L273 TraceCheckUtils]: 1: Hoare triple {3097#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3097#true} is VALID [2018-11-14 17:54:36,512 INFO L256 TraceCheckUtils]: 0: Hoare triple {3097#true} call ULTIMATE.init(); {3097#true} is VALID [2018-11-14 17:54:36,519 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-11-14 17:54:36,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:54:36,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 17:54:36,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2018-11-14 17:54:36,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:54:36,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:54:36,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:54:36,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:54:36,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:54:36,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:54:36,640 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 6 states. [2018-11-14 17:54:36,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:36,944 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-11-14 17:54:36,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:54:36,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2018-11-14 17:54:36,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:54:36,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:54:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2018-11-14 17:54:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:54:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2018-11-14 17:54:36,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2018-11-14 17:54:37,082 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:54:37,085 INFO L225 Difference]: With dead ends: 126 [2018-11-14 17:54:37,085 INFO L226 Difference]: Without dead ends: 105 [2018-11-14 17:54:37,086 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:54:37,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-14 17:54:37,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-11-14 17:54:37,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:54:37,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 105 states. [2018-11-14 17:54:37,248 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 105 states. [2018-11-14 17:54:37,248 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 105 states. [2018-11-14 17:54:37,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:37,252 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-14 17:54:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-14 17:54:37,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:54:37,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:54:37,253 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 105 states. [2018-11-14 17:54:37,254 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 105 states. [2018-11-14 17:54:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:37,258 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-14 17:54:37,258 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-14 17:54:37,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:54:37,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:54:37,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:54:37,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:54:37,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-14 17:54:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-11-14 17:54:37,262 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 112 [2018-11-14 17:54:37,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:54:37,263 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-11-14 17:54:37,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:54:37,263 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-14 17:54:37,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-14 17:54:37,265 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:54:37,265 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 15, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:54:37,265 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:54:37,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:54:37,266 INFO L82 PathProgramCache]: Analyzing trace with hash -484682032, now seen corresponding path program 4 times [2018-11-14 17:54:37,266 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:54:37,266 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:54:37,287 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:54:37,503 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:54:37,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:54:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:54:37,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:54:38,152 INFO L256 TraceCheckUtils]: 0: Hoare triple {4297#true} call ULTIMATE.init(); {4297#true} is VALID [2018-11-14 17:54:38,153 INFO L273 TraceCheckUtils]: 1: Hoare triple {4297#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4297#true} is VALID [2018-11-14 17:54:38,153 INFO L273 TraceCheckUtils]: 2: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:54:38,154 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4297#true} {4297#true} #69#return; {4297#true} is VALID [2018-11-14 17:54:38,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {4297#true} call #t~ret12 := main(); {4297#true} is VALID [2018-11-14 17:54:38,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {4297#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(160bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {4317#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:54:38,155 INFO L273 TraceCheckUtils]: 6: Hoare triple {4317#(= main_~i~1 (_ bv0 32))} assume true; {4317#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:54:38,155 INFO L273 TraceCheckUtils]: 7: Hoare triple {4317#(= main_~i~1 (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4317#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:54:38,156 INFO L273 TraceCheckUtils]: 8: Hoare triple {4317#(= main_~i~1 (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4327#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,156 INFO L273 TraceCheckUtils]: 9: Hoare triple {4327#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume true; {4327#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,156 INFO L273 TraceCheckUtils]: 10: Hoare triple {4327#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4327#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,157 INFO L273 TraceCheckUtils]: 11: Hoare triple {4327#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4337#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,157 INFO L273 TraceCheckUtils]: 12: Hoare triple {4337#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {4337#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,158 INFO L273 TraceCheckUtils]: 13: Hoare triple {4337#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4337#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,159 INFO L273 TraceCheckUtils]: 14: Hoare triple {4337#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4347#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,159 INFO L273 TraceCheckUtils]: 15: Hoare triple {4347#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} assume true; {4347#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,160 INFO L273 TraceCheckUtils]: 16: Hoare triple {4347#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4347#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,161 INFO L273 TraceCheckUtils]: 17: Hoare triple {4347#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4357#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,161 INFO L273 TraceCheckUtils]: 18: Hoare triple {4357#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} assume true; {4357#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,162 INFO L273 TraceCheckUtils]: 19: Hoare triple {4357#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4357#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,162 INFO L273 TraceCheckUtils]: 20: Hoare triple {4357#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4367#(= (_ bv5 32) main_~i~1)} is VALID [2018-11-14 17:54:38,163 INFO L273 TraceCheckUtils]: 21: Hoare triple {4367#(= (_ bv5 32) main_~i~1)} assume true; {4367#(= (_ bv5 32) main_~i~1)} is VALID [2018-11-14 17:54:38,164 INFO L273 TraceCheckUtils]: 22: Hoare triple {4367#(= (_ bv5 32) main_~i~1)} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4367#(= (_ bv5 32) main_~i~1)} is VALID [2018-11-14 17:54:38,164 INFO L273 TraceCheckUtils]: 23: Hoare triple {4367#(= (_ bv5 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4377#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,165 INFO L273 TraceCheckUtils]: 24: Hoare triple {4377#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} assume true; {4377#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,166 INFO L273 TraceCheckUtils]: 25: Hoare triple {4377#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4377#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,166 INFO L273 TraceCheckUtils]: 26: Hoare triple {4377#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4387#(= (_ bv7 32) main_~i~1)} is VALID [2018-11-14 17:54:38,167 INFO L273 TraceCheckUtils]: 27: Hoare triple {4387#(= (_ bv7 32) main_~i~1)} assume true; {4387#(= (_ bv7 32) main_~i~1)} is VALID [2018-11-14 17:54:38,167 INFO L273 TraceCheckUtils]: 28: Hoare triple {4387#(= (_ bv7 32) main_~i~1)} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4387#(= (_ bv7 32) main_~i~1)} is VALID [2018-11-14 17:54:38,168 INFO L273 TraceCheckUtils]: 29: Hoare triple {4387#(= (_ bv7 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4397#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,169 INFO L273 TraceCheckUtils]: 30: Hoare triple {4397#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} assume true; {4397#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,169 INFO L273 TraceCheckUtils]: 31: Hoare triple {4397#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4397#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,170 INFO L273 TraceCheckUtils]: 32: Hoare triple {4397#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4407#(= (_ bv9 32) main_~i~1)} is VALID [2018-11-14 17:54:38,171 INFO L273 TraceCheckUtils]: 33: Hoare triple {4407#(= (_ bv9 32) main_~i~1)} assume true; {4407#(= (_ bv9 32) main_~i~1)} is VALID [2018-11-14 17:54:38,171 INFO L273 TraceCheckUtils]: 34: Hoare triple {4407#(= (_ bv9 32) main_~i~1)} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4407#(= (_ bv9 32) main_~i~1)} is VALID [2018-11-14 17:54:38,172 INFO L273 TraceCheckUtils]: 35: Hoare triple {4407#(= (_ bv9 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4417#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,173 INFO L273 TraceCheckUtils]: 36: Hoare triple {4417#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} assume true; {4417#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,173 INFO L273 TraceCheckUtils]: 37: Hoare triple {4417#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4417#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,174 INFO L273 TraceCheckUtils]: 38: Hoare triple {4417#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4427#(= (_ bv11 32) main_~i~1)} is VALID [2018-11-14 17:54:38,175 INFO L273 TraceCheckUtils]: 39: Hoare triple {4427#(= (_ bv11 32) main_~i~1)} assume true; {4427#(= (_ bv11 32) main_~i~1)} is VALID [2018-11-14 17:54:38,175 INFO L273 TraceCheckUtils]: 40: Hoare triple {4427#(= (_ bv11 32) main_~i~1)} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4427#(= (_ bv11 32) main_~i~1)} is VALID [2018-11-14 17:54:38,176 INFO L273 TraceCheckUtils]: 41: Hoare triple {4427#(= (_ bv11 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4437#(= (bvadd main_~i~1 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,177 INFO L273 TraceCheckUtils]: 42: Hoare triple {4437#(= (bvadd main_~i~1 (_ bv4294967284 32)) (_ bv0 32))} assume true; {4437#(= (bvadd main_~i~1 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,177 INFO L273 TraceCheckUtils]: 43: Hoare triple {4437#(= (bvadd main_~i~1 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4437#(= (bvadd main_~i~1 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,178 INFO L273 TraceCheckUtils]: 44: Hoare triple {4437#(= (bvadd main_~i~1 (_ bv4294967284 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4447#(= (_ bv13 32) main_~i~1)} is VALID [2018-11-14 17:54:38,179 INFO L273 TraceCheckUtils]: 45: Hoare triple {4447#(= (_ bv13 32) main_~i~1)} assume true; {4447#(= (_ bv13 32) main_~i~1)} is VALID [2018-11-14 17:54:38,179 INFO L273 TraceCheckUtils]: 46: Hoare triple {4447#(= (_ bv13 32) main_~i~1)} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4447#(= (_ bv13 32) main_~i~1)} is VALID [2018-11-14 17:54:38,180 INFO L273 TraceCheckUtils]: 47: Hoare triple {4447#(= (_ bv13 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4457#(= (bvadd main_~i~1 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,181 INFO L273 TraceCheckUtils]: 48: Hoare triple {4457#(= (bvadd main_~i~1 (_ bv4294967282 32)) (_ bv0 32))} assume true; {4457#(= (bvadd main_~i~1 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,181 INFO L273 TraceCheckUtils]: 49: Hoare triple {4457#(= (bvadd main_~i~1 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4457#(= (bvadd main_~i~1 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,182 INFO L273 TraceCheckUtils]: 50: Hoare triple {4457#(= (bvadd main_~i~1 (_ bv4294967282 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4467#(= (_ bv15 32) main_~i~1)} is VALID [2018-11-14 17:54:38,183 INFO L273 TraceCheckUtils]: 51: Hoare triple {4467#(= (_ bv15 32) main_~i~1)} assume true; {4467#(= (_ bv15 32) main_~i~1)} is VALID [2018-11-14 17:54:38,183 INFO L273 TraceCheckUtils]: 52: Hoare triple {4467#(= (_ bv15 32) main_~i~1)} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4467#(= (_ bv15 32) main_~i~1)} is VALID [2018-11-14 17:54:38,184 INFO L273 TraceCheckUtils]: 53: Hoare triple {4467#(= (_ bv15 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4477#(= (bvadd main_~i~1 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,185 INFO L273 TraceCheckUtils]: 54: Hoare triple {4477#(= (bvadd main_~i~1 (_ bv4294967280 32)) (_ bv0 32))} assume true; {4477#(= (bvadd main_~i~1 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,185 INFO L273 TraceCheckUtils]: 55: Hoare triple {4477#(= (bvadd main_~i~1 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4477#(= (bvadd main_~i~1 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,186 INFO L273 TraceCheckUtils]: 56: Hoare triple {4477#(= (bvadd main_~i~1 (_ bv4294967280 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4487#(= (_ bv17 32) main_~i~1)} is VALID [2018-11-14 17:54:38,187 INFO L273 TraceCheckUtils]: 57: Hoare triple {4487#(= (_ bv17 32) main_~i~1)} assume true; {4487#(= (_ bv17 32) main_~i~1)} is VALID [2018-11-14 17:54:38,187 INFO L273 TraceCheckUtils]: 58: Hoare triple {4487#(= (_ bv17 32) main_~i~1)} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4487#(= (_ bv17 32) main_~i~1)} is VALID [2018-11-14 17:54:38,188 INFO L273 TraceCheckUtils]: 59: Hoare triple {4487#(= (_ bv17 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4497#(= (bvadd main_~i~1 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,188 INFO L273 TraceCheckUtils]: 60: Hoare triple {4497#(= (bvadd main_~i~1 (_ bv4294967278 32)) (_ bv0 32))} assume true; {4497#(= (bvadd main_~i~1 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,189 INFO L273 TraceCheckUtils]: 61: Hoare triple {4497#(= (bvadd main_~i~1 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4497#(= (bvadd main_~i~1 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,190 INFO L273 TraceCheckUtils]: 62: Hoare triple {4497#(= (bvadd main_~i~1 (_ bv4294967278 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4507#(= (_ bv19 32) main_~i~1)} is VALID [2018-11-14 17:54:38,190 INFO L273 TraceCheckUtils]: 63: Hoare triple {4507#(= (_ bv19 32) main_~i~1)} assume true; {4507#(= (_ bv19 32) main_~i~1)} is VALID [2018-11-14 17:54:38,191 INFO L273 TraceCheckUtils]: 64: Hoare triple {4507#(= (_ bv19 32) main_~i~1)} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4507#(= (_ bv19 32) main_~i~1)} is VALID [2018-11-14 17:54:38,192 INFO L273 TraceCheckUtils]: 65: Hoare triple {4507#(= (_ bv19 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4517#(= (bvadd main_~i~1 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,192 INFO L273 TraceCheckUtils]: 66: Hoare triple {4517#(= (bvadd main_~i~1 (_ bv4294967276 32)) (_ bv0 32))} assume true; {4517#(= (bvadd main_~i~1 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,193 INFO L273 TraceCheckUtils]: 67: Hoare triple {4517#(= (bvadd main_~i~1 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4517#(= (bvadd main_~i~1 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,194 INFO L273 TraceCheckUtils]: 68: Hoare triple {4517#(= (bvadd main_~i~1 (_ bv4294967276 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4527#(= (_ bv21 32) main_~i~1)} is VALID [2018-11-14 17:54:38,194 INFO L273 TraceCheckUtils]: 69: Hoare triple {4527#(= (_ bv21 32) main_~i~1)} assume true; {4527#(= (_ bv21 32) main_~i~1)} is VALID [2018-11-14 17:54:38,195 INFO L273 TraceCheckUtils]: 70: Hoare triple {4527#(= (_ bv21 32) main_~i~1)} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4527#(= (_ bv21 32) main_~i~1)} is VALID [2018-11-14 17:54:38,196 INFO L273 TraceCheckUtils]: 71: Hoare triple {4527#(= (_ bv21 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4537#(= (bvadd main_~i~1 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,196 INFO L273 TraceCheckUtils]: 72: Hoare triple {4537#(= (bvadd main_~i~1 (_ bv4294967274 32)) (_ bv0 32))} assume true; {4537#(= (bvadd main_~i~1 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 17:54:38,197 INFO L273 TraceCheckUtils]: 73: Hoare triple {4537#(= (bvadd main_~i~1 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~1, 40bv32); {4298#false} is VALID [2018-11-14 17:54:38,197 INFO L256 TraceCheckUtils]: 74: Hoare triple {4298#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {4298#false} is VALID [2018-11-14 17:54:38,197 INFO L273 TraceCheckUtils]: 75: Hoare triple {4298#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {4298#false} is VALID [2018-11-14 17:54:38,198 INFO L273 TraceCheckUtils]: 76: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:54:38,198 INFO L273 TraceCheckUtils]: 77: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 17:54:38,198 INFO L273 TraceCheckUtils]: 78: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 17:54:38,198 INFO L273 TraceCheckUtils]: 79: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:54:38,199 INFO L273 TraceCheckUtils]: 80: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 17:54:38,199 INFO L273 TraceCheckUtils]: 81: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 17:54:38,199 INFO L273 TraceCheckUtils]: 82: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:54:38,199 INFO L273 TraceCheckUtils]: 83: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 17:54:38,199 INFO L273 TraceCheckUtils]: 84: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 17:54:38,199 INFO L273 TraceCheckUtils]: 85: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:54:38,200 INFO L273 TraceCheckUtils]: 86: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 17:54:38,200 INFO L273 TraceCheckUtils]: 87: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 17:54:38,200 INFO L273 TraceCheckUtils]: 88: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:54:38,200 INFO L273 TraceCheckUtils]: 89: Hoare triple {4298#false} assume !~bvslt32(~i~0, 40bv32); {4298#false} is VALID [2018-11-14 17:54:38,200 INFO L273 TraceCheckUtils]: 90: Hoare triple {4298#false} #res := ~ret~0[32:0]; {4298#false} is VALID [2018-11-14 17:54:38,200 INFO L273 TraceCheckUtils]: 91: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:54:38,201 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {4298#false} {4298#false} #73#return; {4298#false} is VALID [2018-11-14 17:54:38,201 INFO L273 TraceCheckUtils]: 93: Hoare triple {4298#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {4298#false} is VALID [2018-11-14 17:54:38,201 INFO L256 TraceCheckUtils]: 94: Hoare triple {4298#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {4298#false} is VALID [2018-11-14 17:54:38,201 INFO L273 TraceCheckUtils]: 95: Hoare triple {4298#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {4298#false} is VALID [2018-11-14 17:54:38,201 INFO L273 TraceCheckUtils]: 96: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:54:38,202 INFO L273 TraceCheckUtils]: 97: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 17:54:38,202 INFO L273 TraceCheckUtils]: 98: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 17:54:38,202 INFO L273 TraceCheckUtils]: 99: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:54:38,202 INFO L273 TraceCheckUtils]: 100: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 17:54:38,202 INFO L273 TraceCheckUtils]: 101: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 17:54:38,202 INFO L273 TraceCheckUtils]: 102: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:54:38,203 INFO L273 TraceCheckUtils]: 103: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 17:54:38,203 INFO L273 TraceCheckUtils]: 104: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 17:54:38,203 INFO L273 TraceCheckUtils]: 105: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:54:38,203 INFO L273 TraceCheckUtils]: 106: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 17:54:38,203 INFO L273 TraceCheckUtils]: 107: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 17:54:38,204 INFO L273 TraceCheckUtils]: 108: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:54:38,204 INFO L273 TraceCheckUtils]: 109: Hoare triple {4298#false} assume !~bvslt32(~i~0, 40bv32); {4298#false} is VALID [2018-11-14 17:54:38,204 INFO L273 TraceCheckUtils]: 110: Hoare triple {4298#false} #res := ~ret~0[32:0]; {4298#false} is VALID [2018-11-14 17:54:38,204 INFO L273 TraceCheckUtils]: 111: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:54:38,204 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {4298#false} {4298#false} #75#return; {4298#false} is VALID [2018-11-14 17:54:38,204 INFO L273 TraceCheckUtils]: 113: Hoare triple {4298#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {4298#false} is VALID [2018-11-14 17:54:38,205 INFO L273 TraceCheckUtils]: 114: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:54:38,205 INFO L273 TraceCheckUtils]: 115: Hoare triple {4298#false} assume !~bvslt32(~i~2, 39bv32); {4298#false} is VALID [2018-11-14 17:54:38,205 INFO L273 TraceCheckUtils]: 116: Hoare triple {4298#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(156bv32, ~#x~0.offset), 4bv32); {4298#false} is VALID [2018-11-14 17:54:38,205 INFO L256 TraceCheckUtils]: 117: Hoare triple {4298#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {4298#false} is VALID [2018-11-14 17:54:38,205 INFO L273 TraceCheckUtils]: 118: Hoare triple {4298#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {4298#false} is VALID [2018-11-14 17:54:38,206 INFO L273 TraceCheckUtils]: 119: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:54:38,206 INFO L273 TraceCheckUtils]: 120: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 17:54:38,206 INFO L273 TraceCheckUtils]: 121: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 17:54:38,206 INFO L273 TraceCheckUtils]: 122: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:54:38,206 INFO L273 TraceCheckUtils]: 123: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 17:54:38,206 INFO L273 TraceCheckUtils]: 124: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 17:54:38,207 INFO L273 TraceCheckUtils]: 125: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:54:38,207 INFO L273 TraceCheckUtils]: 126: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 17:54:38,207 INFO L273 TraceCheckUtils]: 127: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 17:54:38,207 INFO L273 TraceCheckUtils]: 128: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:54:38,207 INFO L273 TraceCheckUtils]: 129: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 17:54:38,208 INFO L273 TraceCheckUtils]: 130: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 17:54:38,208 INFO L273 TraceCheckUtils]: 131: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:54:38,208 INFO L273 TraceCheckUtils]: 132: Hoare triple {4298#false} assume !~bvslt32(~i~0, 40bv32); {4298#false} is VALID [2018-11-14 17:54:38,208 INFO L273 TraceCheckUtils]: 133: Hoare triple {4298#false} #res := ~ret~0[32:0]; {4298#false} is VALID [2018-11-14 17:54:38,208 INFO L273 TraceCheckUtils]: 134: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:54:38,208 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {4298#false} {4298#false} #77#return; {4298#false} is VALID [2018-11-14 17:54:38,209 INFO L273 TraceCheckUtils]: 136: Hoare triple {4298#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {4298#false} is VALID [2018-11-14 17:54:38,209 INFO L273 TraceCheckUtils]: 137: Hoare triple {4298#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4298#false} is VALID [2018-11-14 17:54:38,209 INFO L273 TraceCheckUtils]: 138: Hoare triple {4298#false} assume !false; {4298#false} is VALID [2018-11-14 17:54:38,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-14 17:54:38,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:54:40,717 INFO L273 TraceCheckUtils]: 138: Hoare triple {4298#false} assume !false; {4298#false} is VALID [2018-11-14 17:54:40,718 INFO L273 TraceCheckUtils]: 137: Hoare triple {4298#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4298#false} is VALID [2018-11-14 17:54:40,718 INFO L273 TraceCheckUtils]: 136: Hoare triple {4298#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {4298#false} is VALID [2018-11-14 17:54:40,718 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {4297#true} {4298#false} #77#return; {4298#false} is VALID [2018-11-14 17:54:40,718 INFO L273 TraceCheckUtils]: 134: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:54:40,719 INFO L273 TraceCheckUtils]: 133: Hoare triple {4297#true} #res := ~ret~0[32:0]; {4297#true} is VALID [2018-11-14 17:54:40,719 INFO L273 TraceCheckUtils]: 132: Hoare triple {4297#true} assume !~bvslt32(~i~0, 40bv32); {4297#true} is VALID [2018-11-14 17:54:40,719 INFO L273 TraceCheckUtils]: 131: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:54:40,719 INFO L273 TraceCheckUtils]: 130: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 17:54:40,719 INFO L273 TraceCheckUtils]: 129: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 17:54:40,719 INFO L273 TraceCheckUtils]: 128: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:54:40,720 INFO L273 TraceCheckUtils]: 127: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 17:54:40,720 INFO L273 TraceCheckUtils]: 126: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 17:54:40,720 INFO L273 TraceCheckUtils]: 125: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:54:40,720 INFO L273 TraceCheckUtils]: 124: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 17:54:40,720 INFO L273 TraceCheckUtils]: 123: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 17:54:40,720 INFO L273 TraceCheckUtils]: 122: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:54:40,720 INFO L273 TraceCheckUtils]: 121: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 17:54:40,720 INFO L273 TraceCheckUtils]: 120: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 17:54:40,720 INFO L273 TraceCheckUtils]: 119: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:54:40,721 INFO L273 TraceCheckUtils]: 118: Hoare triple {4297#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {4297#true} is VALID [2018-11-14 17:54:40,721 INFO L256 TraceCheckUtils]: 117: Hoare triple {4298#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {4297#true} is VALID [2018-11-14 17:54:40,721 INFO L273 TraceCheckUtils]: 116: Hoare triple {4298#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(156bv32, ~#x~0.offset), 4bv32); {4298#false} is VALID [2018-11-14 17:54:40,721 INFO L273 TraceCheckUtils]: 115: Hoare triple {4298#false} assume !~bvslt32(~i~2, 39bv32); {4298#false} is VALID [2018-11-14 17:54:40,721 INFO L273 TraceCheckUtils]: 114: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:54:40,721 INFO L273 TraceCheckUtils]: 113: Hoare triple {4298#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {4298#false} is VALID [2018-11-14 17:54:40,721 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {4297#true} {4298#false} #75#return; {4298#false} is VALID [2018-11-14 17:54:40,721 INFO L273 TraceCheckUtils]: 111: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:54:40,722 INFO L273 TraceCheckUtils]: 110: Hoare triple {4297#true} #res := ~ret~0[32:0]; {4297#true} is VALID [2018-11-14 17:54:40,722 INFO L273 TraceCheckUtils]: 109: Hoare triple {4297#true} assume !~bvslt32(~i~0, 40bv32); {4297#true} is VALID [2018-11-14 17:54:40,722 INFO L273 TraceCheckUtils]: 108: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:54:40,722 INFO L273 TraceCheckUtils]: 107: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 17:54:40,722 INFO L273 TraceCheckUtils]: 106: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 17:54:40,722 INFO L273 TraceCheckUtils]: 105: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:54:40,722 INFO L273 TraceCheckUtils]: 104: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 17:54:40,722 INFO L273 TraceCheckUtils]: 103: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 17:54:40,722 INFO L273 TraceCheckUtils]: 102: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:54:40,723 INFO L273 TraceCheckUtils]: 101: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 17:54:40,723 INFO L273 TraceCheckUtils]: 100: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 17:54:40,723 INFO L273 TraceCheckUtils]: 99: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:54:40,723 INFO L273 TraceCheckUtils]: 98: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 17:54:40,723 INFO L273 TraceCheckUtils]: 97: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 17:54:40,723 INFO L273 TraceCheckUtils]: 96: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:54:40,723 INFO L273 TraceCheckUtils]: 95: Hoare triple {4297#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {4297#true} is VALID [2018-11-14 17:54:40,723 INFO L256 TraceCheckUtils]: 94: Hoare triple {4298#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {4297#true} is VALID [2018-11-14 17:54:40,724 INFO L273 TraceCheckUtils]: 93: Hoare triple {4298#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {4298#false} is VALID [2018-11-14 17:54:40,724 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {4297#true} {4298#false} #73#return; {4298#false} is VALID [2018-11-14 17:54:40,724 INFO L273 TraceCheckUtils]: 91: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:54:40,724 INFO L273 TraceCheckUtils]: 90: Hoare triple {4297#true} #res := ~ret~0[32:0]; {4297#true} is VALID [2018-11-14 17:54:40,724 INFO L273 TraceCheckUtils]: 89: Hoare triple {4297#true} assume !~bvslt32(~i~0, 40bv32); {4297#true} is VALID [2018-11-14 17:54:40,724 INFO L273 TraceCheckUtils]: 88: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:54:40,724 INFO L273 TraceCheckUtils]: 87: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 17:54:40,725 INFO L273 TraceCheckUtils]: 86: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 17:54:40,725 INFO L273 TraceCheckUtils]: 85: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:54:40,725 INFO L273 TraceCheckUtils]: 84: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 17:54:40,725 INFO L273 TraceCheckUtils]: 83: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 17:54:40,725 INFO L273 TraceCheckUtils]: 82: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:54:40,725 INFO L273 TraceCheckUtils]: 81: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 17:54:40,726 INFO L273 TraceCheckUtils]: 80: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 17:54:40,726 INFO L273 TraceCheckUtils]: 79: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:54:40,726 INFO L273 TraceCheckUtils]: 78: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 17:54:40,726 INFO L273 TraceCheckUtils]: 77: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 40bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 17:54:40,726 INFO L273 TraceCheckUtils]: 76: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:54:40,727 INFO L273 TraceCheckUtils]: 75: Hoare triple {4297#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {4297#true} is VALID [2018-11-14 17:54:40,727 INFO L256 TraceCheckUtils]: 74: Hoare triple {4298#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {4297#true} is VALID [2018-11-14 17:54:40,741 INFO L273 TraceCheckUtils]: 73: Hoare triple {4934#(bvslt main_~i~1 (_ bv40 32))} assume !~bvslt32(~i~1, 40bv32); {4298#false} is VALID [2018-11-14 17:54:40,748 INFO L273 TraceCheckUtils]: 72: Hoare triple {4934#(bvslt main_~i~1 (_ bv40 32))} assume true; {4934#(bvslt main_~i~1 (_ bv40 32))} is VALID [2018-11-14 17:54:40,748 INFO L273 TraceCheckUtils]: 71: Hoare triple {4941#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4934#(bvslt main_~i~1 (_ bv40 32))} is VALID [2018-11-14 17:54:40,748 INFO L273 TraceCheckUtils]: 70: Hoare triple {4941#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4941#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,750 INFO L273 TraceCheckUtils]: 69: Hoare triple {4941#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} assume true; {4941#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,753 INFO L273 TraceCheckUtils]: 68: Hoare triple {4951#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4941#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,754 INFO L273 TraceCheckUtils]: 67: Hoare triple {4951#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4951#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,754 INFO L273 TraceCheckUtils]: 66: Hoare triple {4951#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv40 32))} assume true; {4951#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,758 INFO L273 TraceCheckUtils]: 65: Hoare triple {4961#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4951#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,758 INFO L273 TraceCheckUtils]: 64: Hoare triple {4961#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4961#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,759 INFO L273 TraceCheckUtils]: 63: Hoare triple {4961#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv40 32))} assume true; {4961#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,763 INFO L273 TraceCheckUtils]: 62: Hoare triple {4971#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4961#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,763 INFO L273 TraceCheckUtils]: 61: Hoare triple {4971#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4971#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,764 INFO L273 TraceCheckUtils]: 60: Hoare triple {4971#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv40 32))} assume true; {4971#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,767 INFO L273 TraceCheckUtils]: 59: Hoare triple {4981#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4971#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,768 INFO L273 TraceCheckUtils]: 58: Hoare triple {4981#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4981#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,768 INFO L273 TraceCheckUtils]: 57: Hoare triple {4981#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv40 32))} assume true; {4981#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,772 INFO L273 TraceCheckUtils]: 56: Hoare triple {4991#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4981#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,772 INFO L273 TraceCheckUtils]: 55: Hoare triple {4991#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4991#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,773 INFO L273 TraceCheckUtils]: 54: Hoare triple {4991#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv40 32))} assume true; {4991#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,776 INFO L273 TraceCheckUtils]: 53: Hoare triple {5001#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4991#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,777 INFO L273 TraceCheckUtils]: 52: Hoare triple {5001#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5001#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,777 INFO L273 TraceCheckUtils]: 51: Hoare triple {5001#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv40 32))} assume true; {5001#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,781 INFO L273 TraceCheckUtils]: 50: Hoare triple {5011#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5001#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,781 INFO L273 TraceCheckUtils]: 49: Hoare triple {5011#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5011#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,782 INFO L273 TraceCheckUtils]: 48: Hoare triple {5011#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv40 32))} assume true; {5011#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,786 INFO L273 TraceCheckUtils]: 47: Hoare triple {5021#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5011#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,787 INFO L273 TraceCheckUtils]: 46: Hoare triple {5021#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5021#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,787 INFO L273 TraceCheckUtils]: 45: Hoare triple {5021#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv40 32))} assume true; {5021#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,793 INFO L273 TraceCheckUtils]: 44: Hoare triple {5031#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5021#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,793 INFO L273 TraceCheckUtils]: 43: Hoare triple {5031#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5031#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,794 INFO L273 TraceCheckUtils]: 42: Hoare triple {5031#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv40 32))} assume true; {5031#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,797 INFO L273 TraceCheckUtils]: 41: Hoare triple {5041#(bvslt (bvadd main_~i~1 (_ bv11 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5031#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,797 INFO L273 TraceCheckUtils]: 40: Hoare triple {5041#(bvslt (bvadd main_~i~1 (_ bv11 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5041#(bvslt (bvadd main_~i~1 (_ bv11 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,798 INFO L273 TraceCheckUtils]: 39: Hoare triple {5041#(bvslt (bvadd main_~i~1 (_ bv11 32)) (_ bv40 32))} assume true; {5041#(bvslt (bvadd main_~i~1 (_ bv11 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,802 INFO L273 TraceCheckUtils]: 38: Hoare triple {5051#(bvslt (bvadd main_~i~1 (_ bv12 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5041#(bvslt (bvadd main_~i~1 (_ bv11 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,802 INFO L273 TraceCheckUtils]: 37: Hoare triple {5051#(bvslt (bvadd main_~i~1 (_ bv12 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5051#(bvslt (bvadd main_~i~1 (_ bv12 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,803 INFO L273 TraceCheckUtils]: 36: Hoare triple {5051#(bvslt (bvadd main_~i~1 (_ bv12 32)) (_ bv40 32))} assume true; {5051#(bvslt (bvadd main_~i~1 (_ bv12 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,807 INFO L273 TraceCheckUtils]: 35: Hoare triple {5061#(bvslt (bvadd main_~i~1 (_ bv13 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5051#(bvslt (bvadd main_~i~1 (_ bv12 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,807 INFO L273 TraceCheckUtils]: 34: Hoare triple {5061#(bvslt (bvadd main_~i~1 (_ bv13 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5061#(bvslt (bvadd main_~i~1 (_ bv13 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,808 INFO L273 TraceCheckUtils]: 33: Hoare triple {5061#(bvslt (bvadd main_~i~1 (_ bv13 32)) (_ bv40 32))} assume true; {5061#(bvslt (bvadd main_~i~1 (_ bv13 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,811 INFO L273 TraceCheckUtils]: 32: Hoare triple {5071#(bvslt (bvadd main_~i~1 (_ bv14 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5061#(bvslt (bvadd main_~i~1 (_ bv13 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,812 INFO L273 TraceCheckUtils]: 31: Hoare triple {5071#(bvslt (bvadd main_~i~1 (_ bv14 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5071#(bvslt (bvadd main_~i~1 (_ bv14 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,812 INFO L273 TraceCheckUtils]: 30: Hoare triple {5071#(bvslt (bvadd main_~i~1 (_ bv14 32)) (_ bv40 32))} assume true; {5071#(bvslt (bvadd main_~i~1 (_ bv14 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,818 INFO L273 TraceCheckUtils]: 29: Hoare triple {5081#(bvslt (bvadd main_~i~1 (_ bv15 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5071#(bvslt (bvadd main_~i~1 (_ bv14 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,818 INFO L273 TraceCheckUtils]: 28: Hoare triple {5081#(bvslt (bvadd main_~i~1 (_ bv15 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5081#(bvslt (bvadd main_~i~1 (_ bv15 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,819 INFO L273 TraceCheckUtils]: 27: Hoare triple {5081#(bvslt (bvadd main_~i~1 (_ bv15 32)) (_ bv40 32))} assume true; {5081#(bvslt (bvadd main_~i~1 (_ bv15 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,824 INFO L273 TraceCheckUtils]: 26: Hoare triple {5091#(bvslt (bvadd main_~i~1 (_ bv16 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5081#(bvslt (bvadd main_~i~1 (_ bv15 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,824 INFO L273 TraceCheckUtils]: 25: Hoare triple {5091#(bvslt (bvadd main_~i~1 (_ bv16 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5091#(bvslt (bvadd main_~i~1 (_ bv16 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,825 INFO L273 TraceCheckUtils]: 24: Hoare triple {5091#(bvslt (bvadd main_~i~1 (_ bv16 32)) (_ bv40 32))} assume true; {5091#(bvslt (bvadd main_~i~1 (_ bv16 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,828 INFO L273 TraceCheckUtils]: 23: Hoare triple {5101#(bvslt (bvadd main_~i~1 (_ bv17 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5091#(bvslt (bvadd main_~i~1 (_ bv16 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,828 INFO L273 TraceCheckUtils]: 22: Hoare triple {5101#(bvslt (bvadd main_~i~1 (_ bv17 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5101#(bvslt (bvadd main_~i~1 (_ bv17 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,828 INFO L273 TraceCheckUtils]: 21: Hoare triple {5101#(bvslt (bvadd main_~i~1 (_ bv17 32)) (_ bv40 32))} assume true; {5101#(bvslt (bvadd main_~i~1 (_ bv17 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,833 INFO L273 TraceCheckUtils]: 20: Hoare triple {5111#(bvslt (bvadd main_~i~1 (_ bv18 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5101#(bvslt (bvadd main_~i~1 (_ bv17 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,833 INFO L273 TraceCheckUtils]: 19: Hoare triple {5111#(bvslt (bvadd main_~i~1 (_ bv18 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5111#(bvslt (bvadd main_~i~1 (_ bv18 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,833 INFO L273 TraceCheckUtils]: 18: Hoare triple {5111#(bvslt (bvadd main_~i~1 (_ bv18 32)) (_ bv40 32))} assume true; {5111#(bvslt (bvadd main_~i~1 (_ bv18 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,839 INFO L273 TraceCheckUtils]: 17: Hoare triple {5121#(bvslt (bvadd main_~i~1 (_ bv19 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5111#(bvslt (bvadd main_~i~1 (_ bv18 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,839 INFO L273 TraceCheckUtils]: 16: Hoare triple {5121#(bvslt (bvadd main_~i~1 (_ bv19 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5121#(bvslt (bvadd main_~i~1 (_ bv19 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,839 INFO L273 TraceCheckUtils]: 15: Hoare triple {5121#(bvslt (bvadd main_~i~1 (_ bv19 32)) (_ bv40 32))} assume true; {5121#(bvslt (bvadd main_~i~1 (_ bv19 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,844 INFO L273 TraceCheckUtils]: 14: Hoare triple {5131#(bvslt (bvadd main_~i~1 (_ bv20 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5121#(bvslt (bvadd main_~i~1 (_ bv19 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,844 INFO L273 TraceCheckUtils]: 13: Hoare triple {5131#(bvslt (bvadd main_~i~1 (_ bv20 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5131#(bvslt (bvadd main_~i~1 (_ bv20 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,844 INFO L273 TraceCheckUtils]: 12: Hoare triple {5131#(bvslt (bvadd main_~i~1 (_ bv20 32)) (_ bv40 32))} assume true; {5131#(bvslt (bvadd main_~i~1 (_ bv20 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,847 INFO L273 TraceCheckUtils]: 11: Hoare triple {5141#(bvslt (bvadd main_~i~1 (_ bv21 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5131#(bvslt (bvadd main_~i~1 (_ bv20 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,848 INFO L273 TraceCheckUtils]: 10: Hoare triple {5141#(bvslt (bvadd main_~i~1 (_ bv21 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5141#(bvslt (bvadd main_~i~1 (_ bv21 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,849 INFO L273 TraceCheckUtils]: 9: Hoare triple {5141#(bvslt (bvadd main_~i~1 (_ bv21 32)) (_ bv40 32))} assume true; {5141#(bvslt (bvadd main_~i~1 (_ bv21 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,853 INFO L273 TraceCheckUtils]: 8: Hoare triple {5151#(bvslt (bvadd main_~i~1 (_ bv22 32)) (_ bv40 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5141#(bvslt (bvadd main_~i~1 (_ bv21 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,853 INFO L273 TraceCheckUtils]: 7: Hoare triple {5151#(bvslt (bvadd main_~i~1 (_ bv22 32)) (_ bv40 32))} assume !!~bvslt32(~i~1, 40bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5151#(bvslt (bvadd main_~i~1 (_ bv22 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,854 INFO L273 TraceCheckUtils]: 6: Hoare triple {5151#(bvslt (bvadd main_~i~1 (_ bv22 32)) (_ bv40 32))} assume true; {5151#(bvslt (bvadd main_~i~1 (_ bv22 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,855 INFO L273 TraceCheckUtils]: 5: Hoare triple {4297#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(160bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {5151#(bvslt (bvadd main_~i~1 (_ bv22 32)) (_ bv40 32))} is VALID [2018-11-14 17:54:40,855 INFO L256 TraceCheckUtils]: 4: Hoare triple {4297#true} call #t~ret12 := main(); {4297#true} is VALID [2018-11-14 17:54:40,855 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4297#true} {4297#true} #69#return; {4297#true} is VALID [2018-11-14 17:54:40,855 INFO L273 TraceCheckUtils]: 2: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:54:40,855 INFO L273 TraceCheckUtils]: 1: Hoare triple {4297#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4297#true} is VALID [2018-11-14 17:54:40,855 INFO L256 TraceCheckUtils]: 0: Hoare triple {4297#true} call ULTIMATE.init(); {4297#true} is VALID [2018-11-14 17:54:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-14 17:54:40,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:54:40,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-14 17:54:40,883 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 139 [2018-11-14 17:54:40,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:54:40,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-14 17:54:41,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:54:41,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-14 17:54:41,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-14 17:54:41,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=607, Invalid=1649, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 17:54:41,334 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 48 states. [2018-11-14 17:54:53,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:53,844 INFO L93 Difference]: Finished difference Result 190 states and 215 transitions. [2018-11-14 17:54:53,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-14 17:54:53,844 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 139 [2018-11-14 17:54:53,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:54:53,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:54:53,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 193 transitions. [2018-11-14 17:54:53,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:54:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 193 transitions. [2018-11-14 17:54:53,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 193 transitions. [2018-11-14 17:54:54,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:54:54,230 INFO L225 Difference]: With dead ends: 190 [2018-11-14 17:54:54,230 INFO L226 Difference]: Without dead ends: 159 [2018-11-14 17:54:54,232 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1279, Invalid=2753, Unknown=0, NotChecked=0, Total=4032 [2018-11-14 17:54:54,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-14 17:54:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-11-14 17:54:54,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:54:54,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand 159 states. [2018-11-14 17:54:54,292 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 159 states. [2018-11-14 17:54:54,292 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 159 states. [2018-11-14 17:54:54,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:54,298 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2018-11-14 17:54:54,298 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2018-11-14 17:54:54,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:54:54,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:54:54,299 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 159 states. [2018-11-14 17:54:54,299 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 159 states. [2018-11-14 17:54:54,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:54:54,304 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2018-11-14 17:54:54,305 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2018-11-14 17:54:54,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:54:54,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:54:54,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:54:54,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:54:54,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-14 17:54:54,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 163 transitions. [2018-11-14 17:54:54,311 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 163 transitions. Word has length 139 [2018-11-14 17:54:54,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:54:54,311 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 163 transitions. [2018-11-14 17:54:54,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-14 17:54:54,312 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2018-11-14 17:54:54,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-14 17:54:54,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:54:54,314 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 15, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:54:54,314 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:54:54,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:54:54,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1846942480, now seen corresponding path program 5 times [2018-11-14 17:54:54,315 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:54:54,315 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:54:54,333 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1