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/ldv-regression/test_while_int_true-termination.c_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:13:18,474 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:13:18,481 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:13:18,499 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:13:18,499 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:13:18,501 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:13:18,503 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:13:18,505 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:13:18,508 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:13:18,509 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:13:18,510 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:13:18,510 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:13:18,511 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:13:18,512 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:13:18,513 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:13:18,514 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:13:18,515 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:13:18,517 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:13:18,519 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:13:18,520 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:13:18,521 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:13:18,523 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:13:18,525 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:13:18,525 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:13:18,525 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:13:18,526 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:13:18,527 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:13:18,528 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:13:18,529 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:13:18,530 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:13:18,530 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:13:18,531 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:13:18,531 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:13:18,532 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:13:18,533 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:13:18,533 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:13:18,534 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:13:18,563 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:13:18,564 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:13:18,564 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:13:18,565 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:13:18,565 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:13:18,565 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:13:18,566 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:13:18,567 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:13:18,567 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:13:18,567 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:13:18,567 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:13:18,567 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:13:18,568 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:13:18,568 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:13:18,568 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:13:18,568 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:13:18,568 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:13:18,570 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:13:18,570 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:13:18,570 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:13:18,570 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:13:18,571 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:13:18,571 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:13:18,571 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:13:18,571 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:13:18,571 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:13:18,572 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:13:18,572 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:13:18,572 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:13:18,573 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:13:18,573 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:13:18,573 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:13:18,573 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:13:18,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:13:18,646 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:13:18,650 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:13:18,651 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:13:18,652 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:13:18,653 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test_while_int_true-termination.c_false-unreach-call.i [2018-11-14 18:13:18,721 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f850cf5f5/008a9cd7298b48a195a0cd3bbd878d52/FLAG01fb35db0 [2018-11-14 18:13:19,217 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:13:19,218 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test_while_int_true-termination.c_false-unreach-call.i [2018-11-14 18:13:19,223 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f850cf5f5/008a9cd7298b48a195a0cd3bbd878d52/FLAG01fb35db0 [2018-11-14 18:13:19,237 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f850cf5f5/008a9cd7298b48a195a0cd3bbd878d52 [2018-11-14 18:13:19,247 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:13:19,248 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:13:19,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:13:19,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:13:19,254 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:13:19,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:13:19" (1/1) ... [2018-11-14 18:13:19,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47190e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:13:19, skipping insertion in model container [2018-11-14 18:13:19,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:13:19" (1/1) ... [2018-11-14 18:13:19,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:13:19,289 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:13:19,515 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:13:19,523 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:13:19,543 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:13:19,564 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:13:19,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:13:19 WrapperNode [2018-11-14 18:13:19,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:13:19,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:13:19,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:13:19,566 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:13:19,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:13:19" (1/1) ... [2018-11-14 18:13:19,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:13:19" (1/1) ... [2018-11-14 18:13:19,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:13:19" (1/1) ... [2018-11-14 18:13:19,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:13:19" (1/1) ... [2018-11-14 18:13:19,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:13:19" (1/1) ... [2018-11-14 18:13:19,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:13:19" (1/1) ... [2018-11-14 18:13:19,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:13:19" (1/1) ... [2018-11-14 18:13:19,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:13:19,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:13:19,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:13:19,613 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:13:19,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:13:19" (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:13:19,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:13:19,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:13:19,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-14 18:13:19,753 INFO L138 BoogieDeclarations]: Found implementation of procedure check_error [2018-11-14 18:13:19,753 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:13:19,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:13:19,756 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-14 18:13:19,756 INFO L130 BoogieDeclarations]: Found specification of procedure check_error [2018-11-14 18:13:19,756 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:13:19,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:13:19,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:13:20,244 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:13:20,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:13:20 BoogieIcfgContainer [2018-11-14 18:13:20,245 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:13:20,246 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:13:20,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:13:20,249 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:13:20,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:13:19" (1/3) ... [2018-11-14 18:13:20,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f98c36c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:13:20, skipping insertion in model container [2018-11-14 18:13:20,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:13:19" (2/3) ... [2018-11-14 18:13:20,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f98c36c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:13:20, skipping insertion in model container [2018-11-14 18:13:20,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:13:20" (3/3) ... [2018-11-14 18:13:20,253 INFO L112 eAbstractionObserver]: Analyzing ICFG test_while_int_true-termination.c_false-unreach-call.i [2018-11-14 18:13:20,263 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:13:20,270 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:13:20,284 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:13:20,318 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:13:20,319 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:13:20,319 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:13:20,319 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:13:20,320 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:13:20,320 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:13:20,320 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:13:20,320 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:13:20,320 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:13:20,348 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-14 18:13:20,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 18:13:20,357 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:13:20,358 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:13:20,360 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:13:20,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:13:20,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1835521858, now seen corresponding path program 1 times [2018-11-14 18:13:20,370 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:13:20,370 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:13:20,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:13:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:13:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:13:20,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:13:20,694 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-14 18:13:20,698 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-14 18:13:20,699 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #36#return; {25#true} is VALID [2018-11-14 18:13:20,699 INFO L256 TraceCheckUtils]: 3: Hoare triple {25#true} call #t~ret1 := main(); {25#true} is VALID [2018-11-14 18:13:20,714 INFO L273 TraceCheckUtils]: 4: Hoare triple {25#true} ~i~0 := 0bv32; {42#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:13:20,720 INFO L273 TraceCheckUtils]: 5: Hoare triple {42#(= main_~i~0 (_ bv0 32))} assume true; {42#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:13:20,723 INFO L273 TraceCheckUtils]: 6: Hoare triple {42#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 5bv32);#t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {49#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:13:20,726 INFO L256 TraceCheckUtils]: 7: Hoare triple {49#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call check_error((if ~i~0 != 3bv32 then 1bv32 else 0bv32)); {53#(= (bvadd |check_error_#in~b| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:13:20,729 INFO L273 TraceCheckUtils]: 8: Hoare triple {53#(= (bvadd |check_error_#in~b| (_ bv4294967295 32)) (_ bv0 32))} ~b := #in~b; {57#(= (bvadd check_error_~b (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:13:20,733 INFO L273 TraceCheckUtils]: 9: Hoare triple {57#(= (bvadd check_error_~b (_ bv4294967295 32)) (_ bv0 32))} assume !(~b != 0bv32); {26#false} is VALID [2018-11-14 18:13:20,733 INFO L256 TraceCheckUtils]: 10: Hoare triple {26#false} call __blast_assert(); {26#false} is VALID [2018-11-14 18:13:20,734 INFO L273 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-14 18:13:20,737 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:13:20,737 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:13:20,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:13:20,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 18:13:20,750 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-14 18:13:20,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:13:20,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:13:20,861 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:13:20,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:13:20,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:13:20,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:13:20,876 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 6 states. [2018-11-14 18:13:21,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:13:21,629 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2018-11-14 18:13:21,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:13:21,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-14 18:13:21,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:13:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:13:21,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2018-11-14 18:13:21,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:13:21,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2018-11-14 18:13:21,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2018-11-14 18:13:21,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:13:21,866 INFO L225 Difference]: With dead ends: 46 [2018-11-14 18:13:21,866 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 18:13:21,870 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:13:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 18:13:22,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-11-14 18:13:22,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:13:22,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 22 states. [2018-11-14 18:13:22,101 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 22 states. [2018-11-14 18:13:22,101 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 22 states. [2018-11-14 18:13:22,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:13:22,106 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 18:13:22,106 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 18:13:22,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:13:22,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:13:22,107 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 24 states. [2018-11-14 18:13:22,107 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 24 states. [2018-11-14 18:13:22,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:13:22,111 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 18:13:22,111 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 18:13:22,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:13:22,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:13:22,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:13:22,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:13:22,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:13:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-14 18:13:22,117 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 12 [2018-11-14 18:13:22,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:13:22,118 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-14 18:13:22,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:13:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 18:13:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 18:13:22,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:13:22,120 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:13:22,121 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:13:22,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:13:22,121 INFO L82 PathProgramCache]: Analyzing trace with hash -932126179, now seen corresponding path program 1 times [2018-11-14 18:13:22,122 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:13:22,122 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:13:22,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:13:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:13:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:13:22,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:13:22,511 INFO L256 TraceCheckUtils]: 0: Hoare triple {214#true} call ULTIMATE.init(); {214#true} is VALID [2018-11-14 18:13:22,511 INFO L273 TraceCheckUtils]: 1: Hoare triple {214#true} assume true; {214#true} is VALID [2018-11-14 18:13:22,512 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {214#true} {214#true} #36#return; {214#true} is VALID [2018-11-14 18:13:22,512 INFO L256 TraceCheckUtils]: 3: Hoare triple {214#true} call #t~ret1 := main(); {214#true} is VALID [2018-11-14 18:13:22,525 INFO L273 TraceCheckUtils]: 4: Hoare triple {214#true} ~i~0 := 0bv32; {231#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:13:22,538 INFO L273 TraceCheckUtils]: 5: Hoare triple {231#(= main_~i~0 (_ bv0 32))} assume true; {231#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:13:22,558 INFO L273 TraceCheckUtils]: 6: Hoare triple {231#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 5bv32);#t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {238#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:13:22,558 INFO L256 TraceCheckUtils]: 7: Hoare triple {238#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call check_error((if ~i~0 != 3bv32 then 1bv32 else 0bv32)); {214#true} is VALID [2018-11-14 18:13:22,559 INFO L273 TraceCheckUtils]: 8: Hoare triple {214#true} ~b := #in~b; {214#true} is VALID [2018-11-14 18:13:22,559 INFO L273 TraceCheckUtils]: 9: Hoare triple {214#true} assume ~b != 0bv32; {214#true} is VALID [2018-11-14 18:13:22,559 INFO L273 TraceCheckUtils]: 10: Hoare triple {214#true} assume true; {214#true} is VALID [2018-11-14 18:13:22,570 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {214#true} {238#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #40#return; {238#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:13:22,583 INFO L273 TraceCheckUtils]: 12: Hoare triple {238#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {238#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:13:22,597 INFO L273 TraceCheckUtils]: 13: Hoare triple {238#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 5bv32);#t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {260#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 18:13:22,616 INFO L256 TraceCheckUtils]: 14: Hoare triple {260#(= (_ bv2 32) main_~i~0)} call check_error((if ~i~0 != 3bv32 then 1bv32 else 0bv32)); {264#(= (bvadd |check_error_#in~b| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:13:22,621 INFO L273 TraceCheckUtils]: 15: Hoare triple {264#(= (bvadd |check_error_#in~b| (_ bv4294967295 32)) (_ bv0 32))} ~b := #in~b; {268#(= (bvadd check_error_~b (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:13:22,624 INFO L273 TraceCheckUtils]: 16: Hoare triple {268#(= (bvadd check_error_~b (_ bv4294967295 32)) (_ bv0 32))} assume !(~b != 0bv32); {215#false} is VALID [2018-11-14 18:13:22,624 INFO L256 TraceCheckUtils]: 17: Hoare triple {215#false} call __blast_assert(); {215#false} is VALID [2018-11-14 18:13:22,624 INFO L273 TraceCheckUtils]: 18: Hoare triple {215#false} assume !false; {215#false} is VALID [2018-11-14 18:13:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:13:22,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:13:22,866 INFO L273 TraceCheckUtils]: 18: Hoare triple {215#false} assume !false; {215#false} is VALID [2018-11-14 18:13:22,866 INFO L256 TraceCheckUtils]: 17: Hoare triple {215#false} call __blast_assert(); {215#false} is VALID [2018-11-14 18:13:22,867 INFO L273 TraceCheckUtils]: 16: Hoare triple {284#(not (= (_ bv0 32) check_error_~b))} assume !(~b != 0bv32); {215#false} is VALID [2018-11-14 18:13:22,868 INFO L273 TraceCheckUtils]: 15: Hoare triple {288#(not (= |check_error_#in~b| (_ bv0 32)))} ~b := #in~b; {284#(not (= (_ bv0 32) check_error_~b))} is VALID [2018-11-14 18:13:22,869 INFO L256 TraceCheckUtils]: 14: Hoare triple {292#(not (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} call check_error((if ~i~0 != 3bv32 then 1bv32 else 0bv32)); {288#(not (= |check_error_#in~b| (_ bv0 32)))} is VALID [2018-11-14 18:13:22,870 INFO L273 TraceCheckUtils]: 13: Hoare triple {296#(not (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 5bv32);#t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {292#(not (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:13:22,870 INFO L273 TraceCheckUtils]: 12: Hoare triple {296#(not (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} assume true; {296#(not (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:13:22,872 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {214#true} {296#(not (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} #40#return; {296#(not (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:13:22,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {214#true} assume true; {214#true} is VALID [2018-11-14 18:13:22,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {214#true} assume ~b != 0bv32; {214#true} is VALID [2018-11-14 18:13:22,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {214#true} ~b := #in~b; {214#true} is VALID [2018-11-14 18:13:22,874 INFO L256 TraceCheckUtils]: 7: Hoare triple {296#(not (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} call check_error((if ~i~0 != 3bv32 then 1bv32 else 0bv32)); {214#true} is VALID [2018-11-14 18:13:22,875 INFO L273 TraceCheckUtils]: 6: Hoare triple {318#(not (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 5bv32);#t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {296#(not (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:13:22,876 INFO L273 TraceCheckUtils]: 5: Hoare triple {318#(not (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {318#(not (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:13:22,877 INFO L273 TraceCheckUtils]: 4: Hoare triple {214#true} ~i~0 := 0bv32; {318#(not (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:13:22,877 INFO L256 TraceCheckUtils]: 3: Hoare triple {214#true} call #t~ret1 := main(); {214#true} is VALID [2018-11-14 18:13:22,878 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {214#true} {214#true} #36#return; {214#true} is VALID [2018-11-14 18:13:22,878 INFO L273 TraceCheckUtils]: 1: Hoare triple {214#true} assume true; {214#true} is VALID [2018-11-14 18:13:22,878 INFO L256 TraceCheckUtils]: 0: Hoare triple {214#true} call ULTIMATE.init(); {214#true} is VALID [2018-11-14 18:13:22,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:13:22,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:13:22,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 18:13:22,885 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-11-14 18:13:22,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:13:22,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:13:22,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:13:22,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:13:22,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:13:22,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:13:22,971 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2018-11-14 18:13:23,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:13:23,689 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-11-14 18:13:23,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:13:23,689 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-11-14 18:13:23,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:13:23,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:13:23,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 43 transitions. [2018-11-14 18:13:23,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:13:23,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 43 transitions. [2018-11-14 18:13:23,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 43 transitions. [2018-11-14 18:13:23,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:13:23,780 INFO L225 Difference]: With dead ends: 43 [2018-11-14 18:13:23,780 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 18:13:23,781 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-11-14 18:13:23,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 18:13:23,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-14 18:13:23,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:13:23,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 38 states. [2018-11-14 18:13:23,863 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 38 states. [2018-11-14 18:13:23,863 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 38 states. [2018-11-14 18:13:23,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:13:23,869 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-11-14 18:13:23,869 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-11-14 18:13:23,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:13:23,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:13:23,870 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 40 states. [2018-11-14 18:13:23,870 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 40 states. [2018-11-14 18:13:23,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:13:23,875 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-11-14 18:13:23,875 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-11-14 18:13:23,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:13:23,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:13:23,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:13:23,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:13:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 18:13:23,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-11-14 18:13:23,881 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 19 [2018-11-14 18:13:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:13:23,881 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-14 18:13:23,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:13:23,882 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-11-14 18:13:23,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:13:23,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:13:23,883 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:13:23,883 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:13:23,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:13:23,884 INFO L82 PathProgramCache]: Analyzing trace with hash 362131422, now seen corresponding path program 2 times [2018-11-14 18:13:23,884 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:13:23,885 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:13:23,902 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 18:13:23,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:13:23,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-14 18:13:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 18:13:23,974 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 18:13:24,000 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 18:13:24,001 WARN L170 areAnnotationChecker]: check_errorENTRY has no Hoare annotation [2018-11-14 18:13:24,001 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 18:13:24,001 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 18:13:24,001 WARN L170 areAnnotationChecker]: __blast_assertENTRY has no Hoare annotation [2018-11-14 18:13:24,001 WARN L170 areAnnotationChecker]: __blast_assertENTRY has no Hoare annotation [2018-11-14 18:13:24,002 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 18:13:24,002 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 18:13:24,002 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 18:13:24,002 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 18:13:24,002 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 18:13:24,002 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 18:13:24,002 WARN L170 areAnnotationChecker]: __blast_assertFINAL has no Hoare annotation [2018-11-14 18:13:24,003 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2018-11-14 18:13:24,003 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2018-11-14 18:13:24,003 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2018-11-14 18:13:24,003 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-14 18:13:24,003 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-14 18:13:24,003 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:13:24,003 WARN L170 areAnnotationChecker]: __blast_assertEXIT has no Hoare annotation [2018-11-14 18:13:24,004 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2018-11-14 18:13:24,004 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2018-11-14 18:13:24,004 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2018-11-14 18:13:24,004 WARN L170 areAnnotationChecker]: check_errorEXIT has no Hoare annotation [2018-11-14 18:13:24,004 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-14 18:13:24,004 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-14 18:13:24,004 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:13:24,005 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 18:13:24,005 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 18:13:24,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 06:13:24 BoogieIcfgContainer [2018-11-14 18:13:24,007 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 18:13:24,009 INFO L168 Benchmark]: Toolchain (without parser) took 4761.72 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 705.7 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -523.9 MB). Peak memory consumption was 181.8 MB. Max. memory is 7.1 GB. [2018-11-14 18:13:24,011 INFO L168 Benchmark]: CDTParser took 0.87 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:13:24,012 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.56 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:13:24,013 INFO L168 Benchmark]: Boogie Preprocessor took 46.99 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:13:24,013 INFO L168 Benchmark]: RCFGBuilder took 632.02 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 705.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -749.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2018-11-14 18:13:24,014 INFO L168 Benchmark]: TraceAbstraction took 3762.06 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 215.4 MB). Peak memory consumption was 215.4 MB. Max. memory is 7.1 GB. [2018-11-14 18:13:24,019 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.87 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. * CACSL2BoogieTranslator took 315.56 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 46.99 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 632.02 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 705.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -749.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3762.06 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 215.4 MB). Peak memory consumption was 215.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L23] int i=0; VAL [i=0] [L24] COND TRUE i<5 [L25] i++ VAL [i=1] [L29] CALL check_error(i!=3) VAL [\old(b)=1] [L18] COND TRUE, RET (b) ? (0) : __blast_assert () VAL [\old(b)=1, b=1] [L29] check_error(i!=3) VAL [i=1] [L24] COND TRUE i<5 [L25] i++ VAL [i=2] [L29] CALL check_error(i!=3) VAL [\old(b)=1] [L18] COND TRUE, RET (b) ? (0) : __blast_assert () VAL [\old(b)=1, b=1] [L29] check_error(i!=3) VAL [i=2] [L24] COND TRUE i<5 [L25] i++ VAL [i=3] [L29] CALL check_error(i!=3) VAL [\old(b)=0] [L18] COND FALSE !((b) ? (0) : __blast_assert ()) VAL [\old(b)=0, b=0] [L18] CALL __blast_assert () [L6] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 22 locations, 1 error locations. UNSAFE Result, 3.6s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 SDtfs, 20 SDslu, 167 SDs, 0 SdLazy, 97 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=2, 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.3s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 2061 SizeOfPredicates, 4 NumberOfNonLiveVariables, 56 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 4/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...