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/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:29:40,485 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:29:40,487 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:29:40,501 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:29:40,501 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:29:40,502 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:29:40,504 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:29:40,506 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:29:40,507 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:29:40,508 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:29:40,509 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:29:40,509 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:29:40,510 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:29:40,511 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:29:40,512 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:29:40,513 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:29:40,514 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:29:40,516 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:29:40,518 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:29:40,520 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:29:40,521 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:29:40,522 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:29:40,525 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:29:40,525 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:29:40,526 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:29:40,527 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:29:40,528 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:29:40,529 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:29:40,530 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:29:40,531 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:29:40,531 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:29:40,534 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:29:40,534 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:29:40,534 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:29:40,535 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:29:40,536 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:29:40,536 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 18:29:40,572 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:29:40,572 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:29:40,573 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:29:40,573 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:29:40,575 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:29:40,575 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:29:40,575 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:29:40,576 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:29:40,576 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:29:40,576 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:29:40,576 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:29:40,576 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:29:40,576 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:29:40,578 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:29:40,578 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:29:40,578 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:29:40,578 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:29:40,578 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:29:40,579 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:29:40,579 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:29:40,579 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:29:40,579 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:29:40,579 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:29:40,581 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:29:40,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:29:40,581 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:29:40,582 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:29:40,582 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:29:40,582 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:29:40,582 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:29:40,582 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:29:40,582 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:29:40,583 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:29:40,637 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:29:40,654 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:29:40,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:29:40,662 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:29:40,662 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:29:40,663 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i [2018-11-14 18:29:40,726 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70939c60e/aed79df828ca4719b1fc0df6ed6fc59a/FLAGf421fe5d9 [2018-11-14 18:29:41,126 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:29:41,126 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i [2018-11-14 18:29:41,132 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70939c60e/aed79df828ca4719b1fc0df6ed6fc59a/FLAGf421fe5d9 [2018-11-14 18:29:41,146 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70939c60e/aed79df828ca4719b1fc0df6ed6fc59a [2018-11-14 18:29:41,157 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:29:41,159 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:29:41,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:29:41,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:29:41,164 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:29:41,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:29:41" (1/1) ... [2018-11-14 18:29:41,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e53ccc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:41, skipping insertion in model container [2018-11-14 18:29:41,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:29:41" (1/1) ... [2018-11-14 18:29:41,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:29:41,203 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:29:41,483 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:29:41,488 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:29:41,516 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:29:41,541 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:29:41,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:41 WrapperNode [2018-11-14 18:29:41,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:29:41,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:29:41,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:29:41,543 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:29:41,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:41" (1/1) ... [2018-11-14 18:29:41,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:41" (1/1) ... [2018-11-14 18:29:41,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:41" (1/1) ... [2018-11-14 18:29:41,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:41" (1/1) ... [2018-11-14 18:29:41,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:41" (1/1) ... [2018-11-14 18:29:41,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:41" (1/1) ... [2018-11-14 18:29:41,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:41" (1/1) ... [2018-11-14 18:29:41,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:29:41,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:29:41,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:29:41,617 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:29:41,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:41" (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 18:29:41,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:29:41,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:29:41,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:29:41,750 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:29:41,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:29:41,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 18:29:41,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:29:41,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-14 18:29:41,751 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:29:41,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:29:41,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:29:41,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:29:41,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:29:41,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:29:41,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:29:41,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:29:42,308 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:29:42,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:29:42 BoogieIcfgContainer [2018-11-14 18:29:42,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:29:42,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:29:42,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:29:42,313 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:29:42,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:29:41" (1/3) ... [2018-11-14 18:29:42,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89c3962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:29:42, skipping insertion in model container [2018-11-14 18:29:42,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:41" (2/3) ... [2018-11-14 18:29:42,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89c3962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:29:42, skipping insertion in model container [2018-11-14 18:29:42,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:29:42" (3/3) ... [2018-11-14 18:29:42,318 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4_true-termination.i [2018-11-14 18:29:42,328 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:29:42,337 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:29:42,353 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:29:42,387 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:29:42,388 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:29:42,388 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:29:42,389 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:29:42,389 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:29:42,389 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:29:42,389 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:29:42,389 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:29:42,389 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:29:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-14 18:29:42,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 18:29:42,421 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:29:42,422 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:29:42,424 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:29:42,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:29:42,431 INFO L82 PathProgramCache]: Analyzing trace with hash 853272646, now seen corresponding path program 1 times [2018-11-14 18:29:42,435 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:29:42,436 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 18:29:42,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:29:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:42,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:29:43,035 INFO L256 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2018-11-14 18:29:43,039 INFO L273 TraceCheckUtils]: 1: Hoare triple {29#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {29#true} is VALID [2018-11-14 18:29:43,039 INFO L273 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2018-11-14 18:29:43,040 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #56#return; {29#true} is VALID [2018-11-14 18:29:43,040 INFO L256 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret11 := main(); {29#true} is VALID [2018-11-14 18:29:43,050 INFO L273 TraceCheckUtils]: 5: Hoare triple {29#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~index1~0;havoc ~index2~0;~loop_entered~0 := 0bv32;~index1~0 := #t~nondet1;havoc #t~nondet1;assume (if ~bvult32(~index1~0, 100000bv32) then 1bv32 else 0bv32) != 0bv32;~index2~0 := #t~nondet2;havoc #t~nondet2;assume (if ~bvult32(~index2~0, 100000bv32) then 1bv32 else 0bv32) != 0bv32; {49#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} is VALID [2018-11-14 18:29:43,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {49#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} assume true; {49#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} is VALID [2018-11-14 18:29:43,058 INFO L273 TraceCheckUtils]: 7: Hoare triple {49#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} assume !!~bvult32(~index1~0, ~index2~0); {49#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} is VALID [2018-11-14 18:29:43,061 INFO L256 TraceCheckUtils]: 8: Hoare triple {49#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} call __VERIFIER_assert((if ~bvult32(~index1~0, 100000bv32) && ~bvult32(~index2~0, 100000bv32) then 1bv32 else 0bv32)); {59#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:29:43,062 INFO L273 TraceCheckUtils]: 9: Hoare triple {59#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {63#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:29:43,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {63#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {30#false} is VALID [2018-11-14 18:29:43,063 INFO L273 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2018-11-14 18:29:43,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:29:43,068 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:29:43,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:29:43,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:29:43,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-14 18:29:43,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:29:43,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:29:43,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:29:43,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:29:43,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:29:43,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:29:43,175 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 5 states. [2018-11-14 18:29:44,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:44,030 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2018-11-14 18:29:44,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:29:44,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-14 18:29:44,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:29:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:29:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2018-11-14 18:29:44,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:29:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2018-11-14 18:29:44,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 85 transitions. [2018-11-14 18:29:44,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:29:44,618 INFO L225 Difference]: With dead ends: 62 [2018-11-14 18:29:44,618 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 18:29:44,622 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:29:44,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 18:29:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-11-14 18:29:44,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:29:44,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 28 states. [2018-11-14 18:29:44,693 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 28 states. [2018-11-14 18:29:44,693 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 28 states. [2018-11-14 18:29:44,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:44,700 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 18:29:44,700 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 18:29:44,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:44,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:44,701 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 34 states. [2018-11-14 18:29:44,703 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 34 states. [2018-11-14 18:29:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:44,709 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 18:29:44,709 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 18:29:44,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:44,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:44,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:29:44,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:29:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:29:44,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-14 18:29:44,716 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 12 [2018-11-14 18:29:44,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:29:44,717 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-14 18:29:44,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:29:44,717 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-14 18:29:44,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 18:29:44,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:29:44,719 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:29:44,719 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:29:44,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:29:44,719 INFO L82 PathProgramCache]: Analyzing trace with hash 653700861, now seen corresponding path program 1 times [2018-11-14 18:29:44,720 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:29:44,720 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 18:29:44,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:29:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:44,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:29:44,835 INFO L256 TraceCheckUtils]: 0: Hoare triple {260#true} call ULTIMATE.init(); {260#true} is VALID [2018-11-14 18:29:44,835 INFO L273 TraceCheckUtils]: 1: Hoare triple {260#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {260#true} is VALID [2018-11-14 18:29:44,836 INFO L273 TraceCheckUtils]: 2: Hoare triple {260#true} assume true; {260#true} is VALID [2018-11-14 18:29:44,836 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {260#true} {260#true} #56#return; {260#true} is VALID [2018-11-14 18:29:44,837 INFO L256 TraceCheckUtils]: 4: Hoare triple {260#true} call #t~ret11 := main(); {260#true} is VALID [2018-11-14 18:29:44,840 INFO L273 TraceCheckUtils]: 5: Hoare triple {260#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~index1~0;havoc ~index2~0;~loop_entered~0 := 0bv32;~index1~0 := #t~nondet1;havoc #t~nondet1;assume (if ~bvult32(~index1~0, 100000bv32) then 1bv32 else 0bv32) != 0bv32;~index2~0 := #t~nondet2;havoc #t~nondet2;assume (if ~bvult32(~index2~0, 100000bv32) then 1bv32 else 0bv32) != 0bv32; {280#(= (_ bv0 32) main_~loop_entered~0)} is VALID [2018-11-14 18:29:44,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {280#(= (_ bv0 32) main_~loop_entered~0)} assume true; {280#(= (_ bv0 32) main_~loop_entered~0)} is VALID [2018-11-14 18:29:44,841 INFO L273 TraceCheckUtils]: 7: Hoare triple {280#(= (_ bv0 32) main_~loop_entered~0)} assume !~bvult32(~index1~0, ~index2~0); {280#(= (_ bv0 32) main_~loop_entered~0)} is VALID [2018-11-14 18:29:44,843 INFO L273 TraceCheckUtils]: 8: Hoare triple {280#(= (_ bv0 32) main_~loop_entered~0)} assume ~loop_entered~0 != 0bv32; {261#false} is VALID [2018-11-14 18:29:44,843 INFO L273 TraceCheckUtils]: 9: Hoare triple {261#false} assume true; {261#false} is VALID [2018-11-14 18:29:44,843 INFO L273 TraceCheckUtils]: 10: Hoare triple {261#false} assume !!~bvult32(~index2~0, ~index1~0);call #t~mem7 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index1~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index2~0)), 4bv32); {261#false} is VALID [2018-11-14 18:29:44,844 INFO L256 TraceCheckUtils]: 11: Hoare triple {261#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1bv32 else 0bv32)); {261#false} is VALID [2018-11-14 18:29:44,844 INFO L273 TraceCheckUtils]: 12: Hoare triple {261#false} ~cond := #in~cond; {261#false} is VALID [2018-11-14 18:29:44,845 INFO L273 TraceCheckUtils]: 13: Hoare triple {261#false} assume ~cond == 0bv32; {261#false} is VALID [2018-11-14 18:29:44,845 INFO L273 TraceCheckUtils]: 14: Hoare triple {261#false} assume !false; {261#false} is VALID [2018-11-14 18:29:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:29:44,847 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:29:44,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:29:44,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:29:44,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 18:29:44,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:29:44,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:29:44,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:29:44,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:29:44,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:29:44,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:29:44,881 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 3 states. [2018-11-14 18:29:45,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:45,047 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-11-14 18:29:45,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:29:45,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 18:29:45,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:29:45,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:29:45,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-11-14 18:29:45,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:29:45,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-11-14 18:29:45,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2018-11-14 18:29:45,206 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:29:45,208 INFO L225 Difference]: With dead ends: 40 [2018-11-14 18:29:45,208 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 18:29:45,209 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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 18:29:45,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 18:29:45,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-14 18:29:45,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:29:45,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-14 18:29:45,260 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-14 18:29:45,260 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-14 18:29:45,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:45,267 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-14 18:29:45,268 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-14 18:29:45,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:45,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:45,269 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-14 18:29:45,269 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-14 18:29:45,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:45,274 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-14 18:29:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-14 18:29:45,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:45,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:45,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:29:45,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:29:45,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:29:45,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-14 18:29:45,278 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 15 [2018-11-14 18:29:45,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:29:45,278 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-14 18:29:45,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:29:45,279 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-14 18:29:45,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 18:29:45,280 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:29:45,280 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:29:45,280 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:29:45,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:29:45,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1313509780, now seen corresponding path program 1 times [2018-11-14 18:29:45,281 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:29:45,281 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 18:29:45,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:29:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:45,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:29:45,681 INFO L256 TraceCheckUtils]: 0: Hoare triple {460#true} call ULTIMATE.init(); {460#true} is VALID [2018-11-14 18:29:45,681 INFO L273 TraceCheckUtils]: 1: Hoare triple {460#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {460#true} is VALID [2018-11-14 18:29:45,682 INFO L273 TraceCheckUtils]: 2: Hoare triple {460#true} assume true; {460#true} is VALID [2018-11-14 18:29:45,682 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {460#true} {460#true} #56#return; {460#true} is VALID [2018-11-14 18:29:45,682 INFO L256 TraceCheckUtils]: 4: Hoare triple {460#true} call #t~ret11 := main(); {460#true} is VALID [2018-11-14 18:29:45,684 INFO L273 TraceCheckUtils]: 5: Hoare triple {460#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~index1~0;havoc ~index2~0;~loop_entered~0 := 0bv32;~index1~0 := #t~nondet1;havoc #t~nondet1;assume (if ~bvult32(~index1~0, 100000bv32) then 1bv32 else 0bv32) != 0bv32;~index2~0 := #t~nondet2;havoc #t~nondet2;assume (if ~bvult32(~index2~0, 100000bv32) then 1bv32 else 0bv32) != 0bv32; {480#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} is VALID [2018-11-14 18:29:45,685 INFO L273 TraceCheckUtils]: 6: Hoare triple {480#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} assume true; {480#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} is VALID [2018-11-14 18:29:45,686 INFO L273 TraceCheckUtils]: 7: Hoare triple {480#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} assume !!~bvult32(~index1~0, ~index2~0); {487#(and (bvult main_~index2~0 (_ bv100000 32)) (bvult main_~index1~0 main_~index2~0))} is VALID [2018-11-14 18:29:45,686 INFO L256 TraceCheckUtils]: 8: Hoare triple {487#(and (bvult main_~index2~0 (_ bv100000 32)) (bvult main_~index1~0 main_~index2~0))} call __VERIFIER_assert((if ~bvult32(~index1~0, 100000bv32) && ~bvult32(~index2~0, 100000bv32) then 1bv32 else 0bv32)); {460#true} is VALID [2018-11-14 18:29:45,686 INFO L273 TraceCheckUtils]: 9: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2018-11-14 18:29:45,687 INFO L273 TraceCheckUtils]: 10: Hoare triple {460#true} assume !(~cond == 0bv32); {460#true} is VALID [2018-11-14 18:29:45,687 INFO L273 TraceCheckUtils]: 11: Hoare triple {460#true} assume true; {460#true} is VALID [2018-11-14 18:29:45,688 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {460#true} {487#(and (bvult main_~index2~0 (_ bv100000 32)) (bvult main_~index1~0 main_~index2~0))} #60#return; {487#(and (bvult main_~index2~0 (_ bv100000 32)) (bvult main_~index1~0 main_~index2~0))} is VALID [2018-11-14 18:29:45,804 INFO L273 TraceCheckUtils]: 13: Hoare triple {487#(and (bvult main_~index2~0 (_ bv100000 32)) (bvult main_~index1~0 main_~index2~0))} call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index1~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index2~0)), 4bv32);assume (if #t~mem3 == #t~mem4 then 1bv32 else 0bv32) != 0bv32;havoc #t~mem4;havoc #t~mem3;#t~post5 := ~index1~0;~index1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~index2~0;~index2~0 := ~bvsub32(#t~post6, 1bv32);havoc #t~post6;~loop_entered~0 := 1bv32; {506#(and (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))))} is VALID [2018-11-14 18:29:45,805 INFO L273 TraceCheckUtils]: 14: Hoare triple {506#(and (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))))} assume true; {506#(and (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))))} is VALID [2018-11-14 18:29:45,806 INFO L273 TraceCheckUtils]: 15: Hoare triple {506#(and (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))))} assume !!~bvult32(~index1~0, ~index2~0); {506#(and (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))))} is VALID [2018-11-14 18:29:45,815 INFO L256 TraceCheckUtils]: 16: Hoare triple {506#(and (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))))} call __VERIFIER_assert((if ~bvult32(~index1~0, 100000bv32) && ~bvult32(~index2~0, 100000bv32) then 1bv32 else 0bv32)); {516#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:29:45,816 INFO L273 TraceCheckUtils]: 17: Hoare triple {516#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {520#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:29:45,817 INFO L273 TraceCheckUtils]: 18: Hoare triple {520#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {461#false} is VALID [2018-11-14 18:29:45,818 INFO L273 TraceCheckUtils]: 19: Hoare triple {461#false} assume !false; {461#false} is VALID [2018-11-14 18:29:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:29:45,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:29:46,046 INFO L273 TraceCheckUtils]: 19: Hoare triple {461#false} assume !false; {461#false} is VALID [2018-11-14 18:29:46,048 INFO L273 TraceCheckUtils]: 18: Hoare triple {530#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {461#false} is VALID [2018-11-14 18:29:46,049 INFO L273 TraceCheckUtils]: 17: Hoare triple {534#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {530#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 18:29:46,050 INFO L256 TraceCheckUtils]: 16: Hoare triple {480#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} call __VERIFIER_assert((if ~bvult32(~index1~0, 100000bv32) && ~bvult32(~index2~0, 100000bv32) then 1bv32 else 0bv32)); {534#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 18:29:46,056 INFO L273 TraceCheckUtils]: 15: Hoare triple {480#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} assume !!~bvult32(~index1~0, ~index2~0); {480#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} is VALID [2018-11-14 18:29:46,062 INFO L273 TraceCheckUtils]: 14: Hoare triple {480#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} assume true; {480#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} is VALID [2018-11-14 18:29:46,065 INFO L273 TraceCheckUtils]: 13: Hoare triple {547#(and (bvult (bvadd main_~index2~0 (_ bv4294967295 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv1 32)) (_ bv100000 32)))} call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index1~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index2~0)), 4bv32);assume (if #t~mem3 == #t~mem4 then 1bv32 else 0bv32) != 0bv32;havoc #t~mem4;havoc #t~mem3;#t~post5 := ~index1~0;~index1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~index2~0;~index2~0 := ~bvsub32(#t~post6, 1bv32);havoc #t~post6;~loop_entered~0 := 1bv32; {480#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} is VALID [2018-11-14 18:29:46,067 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {460#true} {547#(and (bvult (bvadd main_~index2~0 (_ bv4294967295 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv1 32)) (_ bv100000 32)))} #60#return; {547#(and (bvult (bvadd main_~index2~0 (_ bv4294967295 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv1 32)) (_ bv100000 32)))} is VALID [2018-11-14 18:29:46,067 INFO L273 TraceCheckUtils]: 11: Hoare triple {460#true} assume true; {460#true} is VALID [2018-11-14 18:29:46,068 INFO L273 TraceCheckUtils]: 10: Hoare triple {460#true} assume !(~cond == 0bv32); {460#true} is VALID [2018-11-14 18:29:46,068 INFO L273 TraceCheckUtils]: 9: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2018-11-14 18:29:46,068 INFO L256 TraceCheckUtils]: 8: Hoare triple {547#(and (bvult (bvadd main_~index2~0 (_ bv4294967295 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv1 32)) (_ bv100000 32)))} call __VERIFIER_assert((if ~bvult32(~index1~0, 100000bv32) && ~bvult32(~index2~0, 100000bv32) then 1bv32 else 0bv32)); {460#true} is VALID [2018-11-14 18:29:46,069 INFO L273 TraceCheckUtils]: 7: Hoare triple {566#(or (and (bvult (bvadd main_~index2~0 (_ bv4294967295 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv1 32)) (_ bv100000 32))) (not (bvult main_~index1~0 main_~index2~0)))} assume !!~bvult32(~index1~0, ~index2~0); {547#(and (bvult (bvadd main_~index2~0 (_ bv4294967295 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv1 32)) (_ bv100000 32)))} is VALID [2018-11-14 18:29:46,069 INFO L273 TraceCheckUtils]: 6: Hoare triple {566#(or (and (bvult (bvadd main_~index2~0 (_ bv4294967295 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv1 32)) (_ bv100000 32))) (not (bvult main_~index1~0 main_~index2~0)))} assume true; {566#(or (and (bvult (bvadd main_~index2~0 (_ bv4294967295 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv1 32)) (_ bv100000 32))) (not (bvult main_~index1~0 main_~index2~0)))} is VALID [2018-11-14 18:29:46,075 INFO L273 TraceCheckUtils]: 5: Hoare triple {460#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~index1~0;havoc ~index2~0;~loop_entered~0 := 0bv32;~index1~0 := #t~nondet1;havoc #t~nondet1;assume (if ~bvult32(~index1~0, 100000bv32) then 1bv32 else 0bv32) != 0bv32;~index2~0 := #t~nondet2;havoc #t~nondet2;assume (if ~bvult32(~index2~0, 100000bv32) then 1bv32 else 0bv32) != 0bv32; {566#(or (and (bvult (bvadd main_~index2~0 (_ bv4294967295 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv1 32)) (_ bv100000 32))) (not (bvult main_~index1~0 main_~index2~0)))} is VALID [2018-11-14 18:29:46,075 INFO L256 TraceCheckUtils]: 4: Hoare triple {460#true} call #t~ret11 := main(); {460#true} is VALID [2018-11-14 18:29:46,076 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {460#true} {460#true} #56#return; {460#true} is VALID [2018-11-14 18:29:46,076 INFO L273 TraceCheckUtils]: 2: Hoare triple {460#true} assume true; {460#true} is VALID [2018-11-14 18:29:46,076 INFO L273 TraceCheckUtils]: 1: Hoare triple {460#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {460#true} is VALID [2018-11-14 18:29:46,077 INFO L256 TraceCheckUtils]: 0: Hoare triple {460#true} call ULTIMATE.init(); {460#true} is VALID [2018-11-14 18:29:46,078 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:29:46,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:29:46,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-14 18:29:46,081 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-11-14 18:29:46,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:29:46,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:29:46,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:29:46,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:29:46,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:29:46,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:29:46,227 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 11 states. [2018-11-14 18:29:47,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:47,970 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-14 18:29:47,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:29:47,970 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-11-14 18:29:47,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:29:47,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:29:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2018-11-14 18:29:47,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:29:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2018-11-14 18:29:47,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 53 transitions. [2018-11-14 18:29:48,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:29:48,479 INFO L225 Difference]: With dead ends: 52 [2018-11-14 18:29:48,479 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 18:29:48,480 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:29:48,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 18:29:48,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 24. [2018-11-14 18:29:48,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:29:48,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 24 states. [2018-11-14 18:29:48,494 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 24 states. [2018-11-14 18:29:48,494 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 24 states. [2018-11-14 18:29:48,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:48,497 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-14 18:29:48,498 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-14 18:29:48,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:48,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:48,499 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 36 states. [2018-11-14 18:29:48,499 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 36 states. [2018-11-14 18:29:48,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:48,501 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-14 18:29:48,502 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-14 18:29:48,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:48,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:48,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:29:48,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:29:48,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:29:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-14 18:29:48,505 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 20 [2018-11-14 18:29:48,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:29:48,505 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-14 18:29:48,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:29:48,505 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 18:29:48,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 18:29:48,506 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:29:48,507 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:29:48,507 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:29:48,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:29:48,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2042551023, now seen corresponding path program 1 times [2018-11-14 18:29:48,508 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:29:48,508 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 18:29:48,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:29:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-14 18:29:50,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:29:51,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-11-14 18:29:51,186 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:29:51,195 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:29:51,198 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:29:51,233 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:29:51,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 53 [2018-11-14 18:29:51,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:29:51,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:29:51,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:29:51,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:63, output treesize:3 [2018-11-14 18:29:51,388 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:29:51,458 INFO L256 TraceCheckUtils]: 0: Hoare triple {775#true} call ULTIMATE.init(); {775#true} is VALID [2018-11-14 18:29:51,459 INFO L273 TraceCheckUtils]: 1: Hoare triple {775#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {775#true} is VALID [2018-11-14 18:29:51,459 INFO L273 TraceCheckUtils]: 2: Hoare triple {775#true} assume true; {775#true} is VALID [2018-11-14 18:29:51,459 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {775#true} {775#true} #56#return; {775#true} is VALID [2018-11-14 18:29:51,459 INFO L256 TraceCheckUtils]: 4: Hoare triple {775#true} call #t~ret11 := main(); {775#true} is VALID [2018-11-14 18:29:51,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {775#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~index1~0;havoc ~index2~0;~loop_entered~0 := 0bv32;~index1~0 := #t~nondet1;havoc #t~nondet1;assume (if ~bvult32(~index1~0, 100000bv32) then 1bv32 else 0bv32) != 0bv32;~index2~0 := #t~nondet2;havoc #t~nondet2;assume (if ~bvult32(~index2~0, 100000bv32) then 1bv32 else 0bv32) != 0bv32; {795#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} is VALID [2018-11-14 18:29:51,462 INFO L273 TraceCheckUtils]: 6: Hoare triple {795#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} assume true; {795#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} is VALID [2018-11-14 18:29:51,463 INFO L273 TraceCheckUtils]: 7: Hoare triple {795#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} assume !!~bvult32(~index1~0, ~index2~0); {802#(and (bvult main_~index2~0 (_ bv100000 32)) (bvult main_~index1~0 main_~index2~0))} is VALID [2018-11-14 18:29:51,463 INFO L256 TraceCheckUtils]: 8: Hoare triple {802#(and (bvult main_~index2~0 (_ bv100000 32)) (bvult main_~index1~0 main_~index2~0))} call __VERIFIER_assert((if ~bvult32(~index1~0, 100000bv32) && ~bvult32(~index2~0, 100000bv32) then 1bv32 else 0bv32)); {775#true} is VALID [2018-11-14 18:29:51,464 INFO L273 TraceCheckUtils]: 9: Hoare triple {775#true} ~cond := #in~cond; {775#true} is VALID [2018-11-14 18:29:51,464 INFO L273 TraceCheckUtils]: 10: Hoare triple {775#true} assume !(~cond == 0bv32); {775#true} is VALID [2018-11-14 18:29:51,464 INFO L273 TraceCheckUtils]: 11: Hoare triple {775#true} assume true; {775#true} is VALID [2018-11-14 18:29:51,465 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {775#true} {802#(and (bvult main_~index2~0 (_ bv100000 32)) (bvult main_~index1~0 main_~index2~0))} #60#return; {802#(and (bvult main_~index2~0 (_ bv100000 32)) (bvult main_~index1~0 main_~index2~0))} is VALID [2018-11-14 18:29:52,774 INFO L273 TraceCheckUtils]: 13: Hoare triple {802#(and (bvult main_~index2~0 (_ bv100000 32)) (bvult main_~index1~0 main_~index2~0))} call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index1~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index2~0)), 4bv32);assume (if #t~mem3 == #t~mem4 then 1bv32 else 0bv32) != 0bv32;havoc #t~mem4;havoc #t~mem3;#t~post5 := ~index1~0;~index1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~index2~0;~index2~0 := ~bvsub32(#t~post6, 1bv32);havoc #t~post6;~loop_entered~0 := 1bv32; {821#(and (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~index1~0) (_ bv4294967292 32))) (select (select |#memory_int| |main_~#array~0.base|) (bvadd (bvmul (_ bv4 32) main_~index2~0) |main_~#array~0.offset| (_ bv4 32)))) (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))))} is VALID [2018-11-14 18:29:52,775 INFO L273 TraceCheckUtils]: 14: Hoare triple {821#(and (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~index1~0) (_ bv4294967292 32))) (select (select |#memory_int| |main_~#array~0.base|) (bvadd (bvmul (_ bv4 32) main_~index2~0) |main_~#array~0.offset| (_ bv4 32)))) (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))))} assume true; {821#(and (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~index1~0) (_ bv4294967292 32))) (select (select |#memory_int| |main_~#array~0.base|) (bvadd (bvmul (_ bv4 32) main_~index2~0) |main_~#array~0.offset| (_ bv4 32)))) (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))))} is VALID [2018-11-14 18:29:52,776 INFO L273 TraceCheckUtils]: 15: Hoare triple {821#(and (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~index1~0) (_ bv4294967292 32))) (select (select |#memory_int| |main_~#array~0.base|) (bvadd (bvmul (_ bv4 32) main_~index2~0) |main_~#array~0.offset| (_ bv4 32)))) (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))))} assume !~bvult32(~index1~0, ~index2~0); {828#(and (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~index1~0) (_ bv4294967292 32))) (select (select |#memory_int| |main_~#array~0.base|) (bvadd (bvmul (_ bv4 32) main_~index2~0) |main_~#array~0.offset| (_ bv4 32)))) (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))) (not (bvult main_~index1~0 main_~index2~0)))} is VALID [2018-11-14 18:29:52,777 INFO L273 TraceCheckUtils]: 16: Hoare triple {828#(and (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~index1~0) (_ bv4294967292 32))) (select (select |#memory_int| |main_~#array~0.base|) (bvadd (bvmul (_ bv4 32) main_~index2~0) |main_~#array~0.offset| (_ bv4 32)))) (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))) (not (bvult main_~index1~0 main_~index2~0)))} assume ~loop_entered~0 != 0bv32; {828#(and (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~index1~0) (_ bv4294967292 32))) (select (select |#memory_int| |main_~#array~0.base|) (bvadd (bvmul (_ bv4 32) main_~index2~0) |main_~#array~0.offset| (_ bv4 32)))) (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))) (not (bvult main_~index1~0 main_~index2~0)))} is VALID [2018-11-14 18:29:52,778 INFO L273 TraceCheckUtils]: 17: Hoare triple {828#(and (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~index1~0) (_ bv4294967292 32))) (select (select |#memory_int| |main_~#array~0.base|) (bvadd (bvmul (_ bv4 32) main_~index2~0) |main_~#array~0.offset| (_ bv4 32)))) (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))) (not (bvult main_~index1~0 main_~index2~0)))} assume true; {828#(and (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~index1~0) (_ bv4294967292 32))) (select (select |#memory_int| |main_~#array~0.base|) (bvadd (bvmul (_ bv4 32) main_~index2~0) |main_~#array~0.offset| (_ bv4 32)))) (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))) (not (bvult main_~index1~0 main_~index2~0)))} is VALID [2018-11-14 18:29:54,788 INFO L273 TraceCheckUtils]: 18: Hoare triple {828#(and (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~index1~0) (_ bv4294967292 32))) (select (select |#memory_int| |main_~#array~0.base|) (bvadd (bvmul (_ bv4 32) main_~index2~0) |main_~#array~0.offset| (_ bv4 32)))) (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))) (not (bvult main_~index1~0 main_~index2~0)))} assume !!~bvult32(~index2~0, ~index1~0);call #t~mem7 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index1~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index2~0)), 4bv32); {838#(= |main_#t~mem8| |main_#t~mem7|)} is UNKNOWN [2018-11-14 18:29:54,790 INFO L256 TraceCheckUtils]: 19: Hoare triple {838#(= |main_#t~mem8| |main_#t~mem7|)} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1bv32 else 0bv32)); {842#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:29:54,791 INFO L273 TraceCheckUtils]: 20: Hoare triple {842#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {846#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:29:54,791 INFO L273 TraceCheckUtils]: 21: Hoare triple {846#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {776#false} is VALID [2018-11-14 18:29:54,792 INFO L273 TraceCheckUtils]: 22: Hoare triple {776#false} assume !false; {776#false} is VALID [2018-11-14 18:29:54,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:29:54,795 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:29:54,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:29:54,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 18:29:54,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-14 18:29:54,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:29:54,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:29:58,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 22 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-14 18:29:58,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:29:58,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:29:58,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:29:58,208 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 9 states. [2018-11-14 18:29:59,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:59,488 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-14 18:29:59,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:29:59,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-14 18:29:59,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:29:59,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:29:59,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2018-11-14 18:29:59,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:29:59,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2018-11-14 18:29:59,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 26 transitions. [2018-11-14 18:30:05,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 24 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:05,341 INFO L225 Difference]: With dead ends: 26 [2018-11-14 18:30:05,341 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 18:30:05,342 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:30:05,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 18:30:05,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 18:30:05,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:30:05,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 18:30:05,344 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 18:30:05,344 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 18:30:05,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:05,344 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 18:30:05,344 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:30:05,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:05,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:05,345 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 18:30:05,345 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 18:30:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:05,345 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 18:30:05,346 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:30:05,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:05,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:05,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:30:05,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:30:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 18:30:05,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 18:30:05,347 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-11-14 18:30:05,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:30:05,347 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 18:30:05,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:30:05,347 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:30:05,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:05,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 18:30:05,847 WARN L179 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-14 18:30:06,094 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2018-11-14 18:30:06,236 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 17 [2018-11-14 18:30:06,240 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 18:30:06,240 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 18:30:06,240 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 18:30:06,240 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 18:30:06,241 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 18:30:06,241 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 18:30:06,241 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 18:30:06,241 INFO L425 ceAbstractionStarter]: For program point L31-1(lines 31 37) no Hoare annotation was computed. [2018-11-14 18:30:06,241 INFO L421 ceAbstractionStarter]: At program point L31-3(lines 31 37) the Hoare annotation is: (or (and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)) (= (_ bv0 32) main_~loop_entered~0)) (let ((.cse1 (bvadd main_~index2~0 (_ bv1 32)))) (and (let ((.cse0 (select |#memory_int| |main_~#array~0.base|))) (= (select .cse0 (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~index1~0) (_ bv4294967292 32))) (select .cse0 (bvadd (bvmul (_ bv4 32) main_~index2~0) |main_~#array~0.offset| (_ bv4 32))))) (bvult .cse1 (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) .cse1)))) [2018-11-14 18:30:06,241 INFO L425 ceAbstractionStarter]: For program point L31-4(lines 20 47) no Hoare annotation was computed. [2018-11-14 18:30:06,241 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 19 47) no Hoare annotation was computed. [2018-11-14 18:30:06,241 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 19 47) no Hoare annotation was computed. [2018-11-14 18:30:06,241 INFO L425 ceAbstractionStarter]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2018-11-14 18:30:06,242 INFO L421 ceAbstractionStarter]: At program point L40-3(lines 40 44) the Hoare annotation is: (or (and (bvult main_~index2~0 (_ bv100000 32)) (bvult main_~index1~0 main_~index2~0)) (let ((.cse1 (bvadd main_~index2~0 (_ bv1 32)))) (and (let ((.cse0 (select |#memory_int| |main_~#array~0.base|))) (= (select .cse0 (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~index1~0) (_ bv4294967292 32))) (select .cse0 (bvadd (bvmul (_ bv4 32) main_~index2~0) |main_~#array~0.offset| (_ bv4 32))))) (bvult .cse1 (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) .cse1)))) [2018-11-14 18:30:06,242 INFO L421 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse1 (bvult main_~index1~0 main_~index2~0))) (or (let ((.cse0 (bvadd main_~index2~0 (_ bv1 32)))) (and (bvult .cse0 (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) .cse0) .cse1)) (and (bvult main_~index2~0 (_ bv100000 32)) (= (_ bv0 32) main_~loop_entered~0) .cse1))) [2018-11-14 18:30:06,242 INFO L425 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2018-11-14 18:30:06,242 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 19 47) the Hoare annotation is: true [2018-11-14 18:30:06,242 INFO L421 ceAbstractionStarter]: At program point L41(line 41) the Hoare annotation is: (let ((.cse1 (bvadd main_~index2~0 (_ bv1 32)))) (and (let ((.cse0 (select |#memory_int| |main_~#array~0.base|))) (= (select .cse0 (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~index1~0) (_ bv4294967292 32))) (select .cse0 (bvadd (bvmul (_ bv4 32) main_~index2~0) |main_~#array~0.offset| (_ bv4 32))))) (= |main_#t~mem8| |main_#t~mem7|) (bvult .cse1 (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) .cse1) (not (bvult main_~index1~0 main_~index2~0)))) [2018-11-14 18:30:06,242 INFO L425 ceAbstractionStarter]: For program point L41-1(line 41) no Hoare annotation was computed. [2018-11-14 18:30:06,243 INFO L425 ceAbstractionStarter]: For program point L39(lines 39 45) no Hoare annotation was computed. [2018-11-14 18:30:06,243 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2018-11-14 18:30:06,243 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2018-11-14 18:30:06,243 INFO L425 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2018-11-14 18:30:06,243 INFO L425 ceAbstractionStarter]: For program point L11(lines 11 13) no Hoare annotation was computed. [2018-11-14 18:30:06,243 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2018-11-14 18:30:06,243 INFO L425 ceAbstractionStarter]: For program point L11-2(lines 9 15) no Hoare annotation was computed. [2018-11-14 18:30:06,245 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 18:30:06,249 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2018-11-14 18:30:06,249 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 18:30:06,249 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:30:06,250 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2018-11-14 18:30:06,250 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2018-11-14 18:30:06,250 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2018-11-14 18:30:06,250 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2018-11-14 18:30:06,250 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 18:30:06,251 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:30:06,251 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2018-11-14 18:30:06,251 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2018-11-14 18:30:06,251 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2018-11-14 18:30:06,251 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2018-11-14 18:30:06,251 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2018-11-14 18:30:06,252 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2018-11-14 18:30:06,252 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2018-11-14 18:30:06,252 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-14 18:30:06,252 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2018-11-14 18:30:06,252 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2018-11-14 18:30:06,252 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2018-11-14 18:30:06,252 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 18:30:06,253 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 18:30:06,253 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-14 18:30:06,253 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2018-11-14 18:30:06,253 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2018-11-14 18:30:06,253 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:30:06,253 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2018-11-14 18:30:06,253 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2018-11-14 18:30:06,253 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 18:30:06,254 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 18:30:06,260 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:06,261 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:06,264 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:06,264 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:06,266 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:06,266 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:06,267 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:06,267 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:06,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 06:30:06 BoogieIcfgContainer [2018-11-14 18:30:06,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 18:30:06,270 INFO L168 Benchmark]: Toolchain (without parser) took 25112.80 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.6 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -318.7 MB). Peak memory consumption was 428.9 MB. Max. memory is 7.1 GB. [2018-11-14 18:30:06,272 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:30:06,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 18:30:06,273 INFO L168 Benchmark]: Boogie Preprocessor took 72.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:30:06,274 INFO L168 Benchmark]: RCFGBuilder took 692.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -767.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2018-11-14 18:30:06,275 INFO L168 Benchmark]: TraceAbstraction took 23959.42 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 438.7 MB). Peak memory consumption was 438.7 MB. Max. memory is 7.1 GB. [2018-11-14 18:30:06,279 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 383.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 692.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -767.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23959.42 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 438.7 MB). Peak memory consumption was 438.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant [2018-11-14 18:30:06,287 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:06,287 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:06,288 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:06,288 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((~bvult32(index1, 100000bv32) && ~bvult32(index2, 100000bv32)) && 0bv32 == loop_entered) || ((unknown-#memory_int-unknown[array][~bvadd64(array, ~bvmul32(4bv32, index1), 4294967292bv32)] == unknown-#memory_int-unknown[array][~bvadd64(~bvmul32(4bv32, index2), array, 4bv32)] && ~bvult32(~bvadd64(index2, 1bv32), 100000bv32)) && ~bvult32(~bvadd64(index1, 4294967295bv32), ~bvadd64(index2, 1bv32))) - InvariantResult [Line: 40]: Loop Invariant [2018-11-14 18:30:06,289 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:06,290 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:06,290 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:06,290 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (~bvult32(index2, 100000bv32) && ~bvult32(index1, index2)) || ((unknown-#memory_int-unknown[array][~bvadd64(array, ~bvmul32(4bv32, index1), 4294967292bv32)] == unknown-#memory_int-unknown[array][~bvadd64(~bvmul32(4bv32, index2), array, 4bv32)] && ~bvult32(~bvadd64(index2, 1bv32), 100000bv32)) && ~bvult32(~bvadd64(index1, 4294967295bv32), ~bvadd64(index2, 1bv32))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. SAFE Result, 23.8s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 11.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 83 SDtfs, 51 SDslu, 257 SDs, 0 SdLazy, 177 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 15 PreInvPairs, 22 NumberOfFragments, 160 HoareAnnotationTreeSize, 15 FomulaSimplifications, 126 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 64 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 9233 SizeOfPredicates, 12 NumberOfNonLiveVariables, 184 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 12/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...