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.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested5_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:48:56,478 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:48:56,480 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:48:56,495 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:48:56,495 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:48:56,497 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:48:56,500 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:48:56,502 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:48:56,503 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:48:56,504 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:48:56,505 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:48:56,505 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:48:56,506 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:48:56,509 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:48:56,515 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:48:56,516 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:48:56,517 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:48:56,522 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:48:56,523 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:48:56,527 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:48:56,528 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:48:56,531 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:48:56,533 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:48:56,533 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:48:56,534 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:48:56,535 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:48:56,539 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:48:56,540 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:48:56,542 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:48:56,544 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:48:56,545 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:48:56,545 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:48:56,546 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:48:56,546 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:48:56,547 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:48:56,547 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:48:56,549 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:48:56,577 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:48:56,577 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:48:56,578 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:48:56,578 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:48:56,579 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:48:56,580 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:48:56,580 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:48:56,580 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:48:56,580 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:48:56,580 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:48:56,582 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:48:56,582 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:48:56,582 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:48:56,582 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:48:56,582 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:48:56,583 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:48:56,583 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:48:56,583 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:48:56,583 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:48:56,583 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:48:56,584 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:48:56,584 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:48:56,584 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:48:56,584 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:48:56,584 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:48:56,585 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:48:56,585 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:48:56,585 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:48:56,585 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:48:56,585 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:48:56,587 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:48:56,587 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:48:56,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:48:56,656 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:48:56,661 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:48:56,663 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:48:56,663 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:48:56,664 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested5_true-unreach-call.c [2018-11-14 16:48:56,747 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8568f12a1/690686dfe17544abbf0f586ddf2f0933/FLAGf72f88d78 [2018-11-14 16:48:57,154 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:48:57,155 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5_true-unreach-call.c [2018-11-14 16:48:57,161 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8568f12a1/690686dfe17544abbf0f586ddf2f0933/FLAGf72f88d78 [2018-11-14 16:48:57,177 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8568f12a1/690686dfe17544abbf0f586ddf2f0933 [2018-11-14 16:48:57,188 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:48:57,189 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:48:57,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:48:57,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:48:57,195 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:48:57,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:48:57" (1/1) ... [2018-11-14 16:48:57,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd8c054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:57, skipping insertion in model container [2018-11-14 16:48:57,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:48:57" (1/1) ... [2018-11-14 16:48:57,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:48:57,240 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:48:57,496 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:48:57,502 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:48:57,524 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:48:57,541 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:48:57,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:57 WrapperNode [2018-11-14 16:48:57,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:48:57,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:48:57,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:48:57,543 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:48:57,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:57" (1/1) ... [2018-11-14 16:48:57,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:57" (1/1) ... [2018-11-14 16:48:57,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:57" (1/1) ... [2018-11-14 16:48:57,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:57" (1/1) ... [2018-11-14 16:48:57,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:57" (1/1) ... [2018-11-14 16:48:57,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:57" (1/1) ... [2018-11-14 16:48:57,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:57" (1/1) ... [2018-11-14 16:48:57,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:48:57,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:48:57,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:48:57,592 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:48:57,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:57" (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 16:48:57,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:48:57,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:48:57,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:48:57,731 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:48:57,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:48:57,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:48:57,731 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:48:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:48:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:48:58,286 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:48:58,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:48:58 BoogieIcfgContainer [2018-11-14 16:48:58,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:48:58,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:48:58,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:48:58,291 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:48:58,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:48:57" (1/3) ... [2018-11-14 16:48:58,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d6cc65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:48:58, skipping insertion in model container [2018-11-14 16:48:58,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:57" (2/3) ... [2018-11-14 16:48:58,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d6cc65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:48:58, skipping insertion in model container [2018-11-14 16:48:58,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:48:58" (3/3) ... [2018-11-14 16:48:58,295 INFO L112 eAbstractionObserver]: Analyzing ICFG nested5_true-unreach-call.c [2018-11-14 16:48:58,304 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:48:58,315 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:48:58,333 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:48:58,381 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:48:58,382 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:48:58,382 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:48:58,382 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:48:58,382 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:48:58,383 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:48:58,383 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:48:58,383 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:48:58,383 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:48:58,403 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-14 16:48:58,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 16:48:58,410 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:48:58,411 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:48:58,413 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:48:58,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:48:58,419 INFO L82 PathProgramCache]: Analyzing trace with hash -909603619, now seen corresponding path program 1 times [2018-11-14 16:48:58,423 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:48:58,423 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 16:48:58,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:48:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:48:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:48:58,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:48:58,563 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-14 16:48:58,566 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-14 16:48:58,567 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #86#return; {34#true} is VALID [2018-11-14 16:48:58,567 INFO L256 TraceCheckUtils]: 3: Hoare triple {34#true} call #t~ret5 := main(); {34#true} is VALID [2018-11-14 16:48:58,567 INFO L273 TraceCheckUtils]: 4: Hoare triple {34#true} ~x~0 := 0bv32;~y~0 := 0bv32;~z~0 := 0bv32;~w~0 := 0bv32;~v~0 := 0bv32;~w~0 := 0bv32; {34#true} is VALID [2018-11-14 16:48:58,568 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-14 16:48:58,568 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !!~bvult32(~w~0, 268435455bv32);~x~0 := 0bv32; {34#true} is VALID [2018-11-14 16:48:58,568 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-14 16:48:58,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#true} assume !!~bvult32(~x~0, 10bv32);~y~0 := 0bv32; {34#true} is VALID [2018-11-14 16:48:58,569 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-14 16:48:58,569 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#true} assume !!~bvult32(~y~0, 10bv32);~z~0 := 0bv32; {34#true} is VALID [2018-11-14 16:48:58,570 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-14 16:48:58,570 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#true} assume !!~bvult32(~z~0, 10bv32);~v~0 := 0bv32; {34#true} is VALID [2018-11-14 16:48:58,572 INFO L273 TraceCheckUtils]: 13: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-14 16:48:58,572 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call __VERIFIER_assert(~bvurem32(~v~0, 4bv32)); {35#false} is VALID [2018-11-14 16:48:58,573 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2018-11-14 16:48:58,574 INFO L273 TraceCheckUtils]: 16: Hoare triple {35#false} assume ~cond == 0bv32; {35#false} is VALID [2018-11-14 16:48:58,575 INFO L273 TraceCheckUtils]: 17: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-14 16:48:58,579 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 16:48:58,580 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:48:58,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:48:58,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:48:58,590 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 16:48:58,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:48:58,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:48:58,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:48:58,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:48:58,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:48:58,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:48:58,705 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-14 16:48:58,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:48:58,948 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2018-11-14 16:48:58,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:48:58,949 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 16:48:58,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:48:58,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:48:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 78 transitions. [2018-11-14 16:48:58,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:48:58,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 78 transitions. [2018-11-14 16:48:58,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 78 transitions. [2018-11-14 16:48:59,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:48:59,301 INFO L225 Difference]: With dead ends: 57 [2018-11-14 16:48:59,302 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 16:48:59,305 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:48:59,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 16:48:59,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-14 16:48:59,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:48:59,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-14 16:48:59,349 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 16:48:59,349 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 16:48:59,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:48:59,356 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-14 16:48:59,357 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-14 16:48:59,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:48:59,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:48:59,358 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 16:48:59,358 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 16:48:59,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:48:59,362 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-14 16:48:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-14 16:48:59,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:48:59,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:48:59,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:48:59,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:48:59,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 16:48:59,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-14 16:48:59,372 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 18 [2018-11-14 16:48:59,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:48:59,372 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-14 16:48:59,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:48:59,373 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-14 16:48:59,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 16:48:59,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:48:59,374 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:48:59,374 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:48:59,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:48:59,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1571052641, now seen corresponding path program 1 times [2018-11-14 16:48:59,376 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:48:59,376 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 16:48:59,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:48:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:48:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:48:59,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:48:59,502 INFO L256 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2018-11-14 16:48:59,502 INFO L273 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2018-11-14 16:48:59,503 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #86#return; {256#true} is VALID [2018-11-14 16:48:59,503 INFO L256 TraceCheckUtils]: 3: Hoare triple {256#true} call #t~ret5 := main(); {256#true} is VALID [2018-11-14 16:48:59,504 INFO L273 TraceCheckUtils]: 4: Hoare triple {256#true} ~x~0 := 0bv32;~y~0 := 0bv32;~z~0 := 0bv32;~w~0 := 0bv32;~v~0 := 0bv32;~w~0 := 0bv32; {256#true} is VALID [2018-11-14 16:48:59,504 INFO L273 TraceCheckUtils]: 5: Hoare triple {256#true} assume true; {256#true} is VALID [2018-11-14 16:48:59,505 INFO L273 TraceCheckUtils]: 6: Hoare triple {256#true} assume !!~bvult32(~w~0, 268435455bv32);~x~0 := 0bv32; {256#true} is VALID [2018-11-14 16:48:59,505 INFO L273 TraceCheckUtils]: 7: Hoare triple {256#true} assume true; {256#true} is VALID [2018-11-14 16:48:59,506 INFO L273 TraceCheckUtils]: 8: Hoare triple {256#true} assume !!~bvult32(~x~0, 10bv32);~y~0 := 0bv32; {256#true} is VALID [2018-11-14 16:48:59,506 INFO L273 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2018-11-14 16:48:59,506 INFO L273 TraceCheckUtils]: 10: Hoare triple {256#true} assume !!~bvult32(~y~0, 10bv32);~z~0 := 0bv32; {256#true} is VALID [2018-11-14 16:48:59,507 INFO L273 TraceCheckUtils]: 11: Hoare triple {256#true} assume true; {256#true} is VALID [2018-11-14 16:48:59,516 INFO L273 TraceCheckUtils]: 12: Hoare triple {256#true} assume !!~bvult32(~z~0, 10bv32);~v~0 := 0bv32; {297#(= main_~v~0 (_ bv0 32))} is VALID [2018-11-14 16:48:59,517 INFO L273 TraceCheckUtils]: 13: Hoare triple {297#(= main_~v~0 (_ bv0 32))} assume true; {297#(= main_~v~0 (_ bv0 32))} is VALID [2018-11-14 16:48:59,517 INFO L273 TraceCheckUtils]: 14: Hoare triple {297#(= main_~v~0 (_ bv0 32))} assume !~bvult32(~v~0, 10bv32); {257#false} is VALID [2018-11-14 16:48:59,518 INFO L256 TraceCheckUtils]: 15: Hoare triple {257#false} call __VERIFIER_assert(~bvurem32(~v~0, 4bv32)); {257#false} is VALID [2018-11-14 16:48:59,518 INFO L273 TraceCheckUtils]: 16: Hoare triple {257#false} ~cond := #in~cond; {257#false} is VALID [2018-11-14 16:48:59,518 INFO L273 TraceCheckUtils]: 17: Hoare triple {257#false} assume ~cond == 0bv32; {257#false} is VALID [2018-11-14 16:48:59,519 INFO L273 TraceCheckUtils]: 18: Hoare triple {257#false} assume !false; {257#false} is VALID [2018-11-14 16:48:59,521 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 16:48:59,521 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:48:59,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:48:59,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:48:59,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 16:48:59,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:48:59,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:48:59,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:48:59,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:48:59,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:48:59,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:48:59,608 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2018-11-14 16:49:00,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:49:00,056 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2018-11-14 16:49:00,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:49:00,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 16:49:00,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:49:00,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:49:00,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-14 16:49:00,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:49:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-14 16:49:00,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 75 transitions. [2018-11-14 16:49:00,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:49:00,193 INFO L225 Difference]: With dead ends: 63 [2018-11-14 16:49:00,193 INFO L226 Difference]: Without dead ends: 41 [2018-11-14 16:49:00,194 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:49:00,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-14 16:49:00,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2018-11-14 16:49:00,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:49:00,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 29 states. [2018-11-14 16:49:00,214 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 29 states. [2018-11-14 16:49:00,214 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 29 states. [2018-11-14 16:49:00,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:49:00,217 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-11-14 16:49:00,218 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2018-11-14 16:49:00,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:49:00,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:49:00,219 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 41 states. [2018-11-14 16:49:00,219 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 41 states. [2018-11-14 16:49:00,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:49:00,223 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-11-14 16:49:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2018-11-14 16:49:00,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:49:00,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:49:00,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:49:00,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:49:00,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 16:49:00,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-14 16:49:00,227 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 19 [2018-11-14 16:49:00,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:49:00,228 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-14 16:49:00,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:49:00,228 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 16:49:00,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:49:00,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:49:00,229 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:49:00,229 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:49:00,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:49:00,230 INFO L82 PathProgramCache]: Analyzing trace with hash -90353287, now seen corresponding path program 1 times [2018-11-14 16:49:00,230 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:49:00,231 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 16:49:00,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:49:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:49:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:49:00,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:49:00,387 INFO L256 TraceCheckUtils]: 0: Hoare triple {524#true} call ULTIMATE.init(); {524#true} is VALID [2018-11-14 16:49:00,387 INFO L273 TraceCheckUtils]: 1: Hoare triple {524#true} assume true; {524#true} is VALID [2018-11-14 16:49:00,388 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {524#true} {524#true} #86#return; {524#true} is VALID [2018-11-14 16:49:00,388 INFO L256 TraceCheckUtils]: 3: Hoare triple {524#true} call #t~ret5 := main(); {524#true} is VALID [2018-11-14 16:49:00,388 INFO L273 TraceCheckUtils]: 4: Hoare triple {524#true} ~x~0 := 0bv32;~y~0 := 0bv32;~z~0 := 0bv32;~w~0 := 0bv32;~v~0 := 0bv32;~w~0 := 0bv32; {524#true} is VALID [2018-11-14 16:49:00,389 INFO L273 TraceCheckUtils]: 5: Hoare triple {524#true} assume true; {524#true} is VALID [2018-11-14 16:49:00,389 INFO L273 TraceCheckUtils]: 6: Hoare triple {524#true} assume !!~bvult32(~w~0, 268435455bv32);~x~0 := 0bv32; {524#true} is VALID [2018-11-14 16:49:00,389 INFO L273 TraceCheckUtils]: 7: Hoare triple {524#true} assume true; {524#true} is VALID [2018-11-14 16:49:00,389 INFO L273 TraceCheckUtils]: 8: Hoare triple {524#true} assume !!~bvult32(~x~0, 10bv32);~y~0 := 0bv32; {524#true} is VALID [2018-11-14 16:49:00,390 INFO L273 TraceCheckUtils]: 9: Hoare triple {524#true} assume true; {524#true} is VALID [2018-11-14 16:49:00,390 INFO L273 TraceCheckUtils]: 10: Hoare triple {524#true} assume !!~bvult32(~y~0, 10bv32);~z~0 := 0bv32; {524#true} is VALID [2018-11-14 16:49:00,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {524#true} assume true; {524#true} is VALID [2018-11-14 16:49:00,391 INFO L273 TraceCheckUtils]: 12: Hoare triple {524#true} assume !!~bvult32(~z~0, 10bv32);~v~0 := 0bv32; {565#(= main_~v~0 (_ bv0 32))} is VALID [2018-11-14 16:49:00,393 INFO L273 TraceCheckUtils]: 13: Hoare triple {565#(= main_~v~0 (_ bv0 32))} assume true; {565#(= main_~v~0 (_ bv0 32))} is VALID [2018-11-14 16:49:00,398 INFO L273 TraceCheckUtils]: 14: Hoare triple {565#(= main_~v~0 (_ bv0 32))} assume !!~bvult32(~v~0, 10bv32); {565#(= main_~v~0 (_ bv0 32))} is VALID [2018-11-14 16:49:00,404 INFO L273 TraceCheckUtils]: 15: Hoare triple {565#(= main_~v~0 (_ bv0 32))} #t~post4 := ~v~0;~v~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {575#(= (_ bv1 32) main_~v~0)} is VALID [2018-11-14 16:49:00,405 INFO L273 TraceCheckUtils]: 16: Hoare triple {575#(= (_ bv1 32) main_~v~0)} assume true; {575#(= (_ bv1 32) main_~v~0)} is VALID [2018-11-14 16:49:00,405 INFO L273 TraceCheckUtils]: 17: Hoare triple {575#(= (_ bv1 32) main_~v~0)} assume !~bvult32(~v~0, 10bv32); {525#false} is VALID [2018-11-14 16:49:00,406 INFO L256 TraceCheckUtils]: 18: Hoare triple {525#false} call __VERIFIER_assert(~bvurem32(~v~0, 4bv32)); {525#false} is VALID [2018-11-14 16:49:00,406 INFO L273 TraceCheckUtils]: 19: Hoare triple {525#false} ~cond := #in~cond; {525#false} is VALID [2018-11-14 16:49:00,406 INFO L273 TraceCheckUtils]: 20: Hoare triple {525#false} assume ~cond == 0bv32; {525#false} is VALID [2018-11-14 16:49:00,406 INFO L273 TraceCheckUtils]: 21: Hoare triple {525#false} assume !false; {525#false} is VALID [2018-11-14 16:49:00,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:49:00,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:49:00,537 INFO L273 TraceCheckUtils]: 21: Hoare triple {525#false} assume !false; {525#false} is VALID [2018-11-14 16:49:00,537 INFO L273 TraceCheckUtils]: 20: Hoare triple {525#false} assume ~cond == 0bv32; {525#false} is VALID [2018-11-14 16:49:00,538 INFO L273 TraceCheckUtils]: 19: Hoare triple {525#false} ~cond := #in~cond; {525#false} is VALID [2018-11-14 16:49:00,538 INFO L256 TraceCheckUtils]: 18: Hoare triple {525#false} call __VERIFIER_assert(~bvurem32(~v~0, 4bv32)); {525#false} is VALID [2018-11-14 16:49:00,541 INFO L273 TraceCheckUtils]: 17: Hoare triple {606#(bvult main_~v~0 (_ bv10 32))} assume !~bvult32(~v~0, 10bv32); {525#false} is VALID [2018-11-14 16:49:00,542 INFO L273 TraceCheckUtils]: 16: Hoare triple {606#(bvult main_~v~0 (_ bv10 32))} assume true; {606#(bvult main_~v~0 (_ bv10 32))} is VALID [2018-11-14 16:49:00,558 INFO L273 TraceCheckUtils]: 15: Hoare triple {613#(bvult (bvadd main_~v~0 (_ bv1 32)) (_ bv10 32))} #t~post4 := ~v~0;~v~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {606#(bvult main_~v~0 (_ bv10 32))} is VALID [2018-11-14 16:49:00,560 INFO L273 TraceCheckUtils]: 14: Hoare triple {613#(bvult (bvadd main_~v~0 (_ bv1 32)) (_ bv10 32))} assume !!~bvult32(~v~0, 10bv32); {613#(bvult (bvadd main_~v~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-14 16:49:00,560 INFO L273 TraceCheckUtils]: 13: Hoare triple {613#(bvult (bvadd main_~v~0 (_ bv1 32)) (_ bv10 32))} assume true; {613#(bvult (bvadd main_~v~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-14 16:49:00,562 INFO L273 TraceCheckUtils]: 12: Hoare triple {524#true} assume !!~bvult32(~z~0, 10bv32);~v~0 := 0bv32; {613#(bvult (bvadd main_~v~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-14 16:49:00,562 INFO L273 TraceCheckUtils]: 11: Hoare triple {524#true} assume true; {524#true} is VALID [2018-11-14 16:49:00,563 INFO L273 TraceCheckUtils]: 10: Hoare triple {524#true} assume !!~bvult32(~y~0, 10bv32);~z~0 := 0bv32; {524#true} is VALID [2018-11-14 16:49:00,563 INFO L273 TraceCheckUtils]: 9: Hoare triple {524#true} assume true; {524#true} is VALID [2018-11-14 16:49:00,563 INFO L273 TraceCheckUtils]: 8: Hoare triple {524#true} assume !!~bvult32(~x~0, 10bv32);~y~0 := 0bv32; {524#true} is VALID [2018-11-14 16:49:00,564 INFO L273 TraceCheckUtils]: 7: Hoare triple {524#true} assume true; {524#true} is VALID [2018-11-14 16:49:00,564 INFO L273 TraceCheckUtils]: 6: Hoare triple {524#true} assume !!~bvult32(~w~0, 268435455bv32);~x~0 := 0bv32; {524#true} is VALID [2018-11-14 16:49:00,564 INFO L273 TraceCheckUtils]: 5: Hoare triple {524#true} assume true; {524#true} is VALID [2018-11-14 16:49:00,565 INFO L273 TraceCheckUtils]: 4: Hoare triple {524#true} ~x~0 := 0bv32;~y~0 := 0bv32;~z~0 := 0bv32;~w~0 := 0bv32;~v~0 := 0bv32;~w~0 := 0bv32; {524#true} is VALID [2018-11-14 16:49:00,565 INFO L256 TraceCheckUtils]: 3: Hoare triple {524#true} call #t~ret5 := main(); {524#true} is VALID [2018-11-14 16:49:00,565 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {524#true} {524#true} #86#return; {524#true} is VALID [2018-11-14 16:49:00,565 INFO L273 TraceCheckUtils]: 1: Hoare triple {524#true} assume true; {524#true} is VALID [2018-11-14 16:49:00,566 INFO L256 TraceCheckUtils]: 0: Hoare triple {524#true} call ULTIMATE.init(); {524#true} is VALID [2018-11-14 16:49:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:49:00,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:49:00,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 16:49:00,569 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-14 16:49:00,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:49:00,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:49:00,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:49:00,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:49:00,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:49:00,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:49:00,671 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 6 states. [2018-11-14 16:49:01,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:49:01,175 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2018-11-14 16:49:01,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:49:01,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-14 16:49:01,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:49:01,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:49:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2018-11-14 16:49:01,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:49:01,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2018-11-14 16:49:01,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 85 transitions. [2018-11-14 16:49:01,364 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 16:49:01,366 INFO L225 Difference]: With dead ends: 73 [2018-11-14 16:49:01,366 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 16:49:01,367 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:49:01,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 16:49:01,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38. [2018-11-14 16:49:01,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:49:01,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 38 states. [2018-11-14 16:49:01,392 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 38 states. [2018-11-14 16:49:01,392 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 38 states. [2018-11-14 16:49:01,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:49:01,396 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-14 16:49:01,396 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-14 16:49:01,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:49:01,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:49:01,397 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 49 states. [2018-11-14 16:49:01,397 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 49 states. [2018-11-14 16:49:01,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:49:01,401 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-14 16:49:01,401 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-14 16:49:01,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:49:01,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:49:01,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:49:01,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:49:01,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 16:49:01,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-14 16:49:01,405 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 22 [2018-11-14 16:49:01,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:49:01,405 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-14 16:49:01,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:49:01,406 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-14 16:49:01,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 16:49:01,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:49:01,407 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:49:01,408 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:49:01,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:49:01,408 INFO L82 PathProgramCache]: Analyzing trace with hash 58666593, now seen corresponding path program 2 times [2018-11-14 16:49:01,409 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:49:01,409 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 16:49:01,439 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:49:01,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:49:01,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:49:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:49:01,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:49:01,610 INFO L256 TraceCheckUtils]: 0: Hoare triple {914#true} call ULTIMATE.init(); {914#true} is VALID [2018-11-14 16:49:01,611 INFO L273 TraceCheckUtils]: 1: Hoare triple {914#true} assume true; {914#true} is VALID [2018-11-14 16:49:01,611 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {914#true} {914#true} #86#return; {914#true} is VALID [2018-11-14 16:49:01,612 INFO L256 TraceCheckUtils]: 3: Hoare triple {914#true} call #t~ret5 := main(); {914#true} is VALID [2018-11-14 16:49:01,612 INFO L273 TraceCheckUtils]: 4: Hoare triple {914#true} ~x~0 := 0bv32;~y~0 := 0bv32;~z~0 := 0bv32;~w~0 := 0bv32;~v~0 := 0bv32;~w~0 := 0bv32; {914#true} is VALID [2018-11-14 16:49:01,613 INFO L273 TraceCheckUtils]: 5: Hoare triple {914#true} assume true; {914#true} is VALID [2018-11-14 16:49:01,613 INFO L273 TraceCheckUtils]: 6: Hoare triple {914#true} assume !!~bvult32(~w~0, 268435455bv32);~x~0 := 0bv32; {914#true} is VALID [2018-11-14 16:49:01,613 INFO L273 TraceCheckUtils]: 7: Hoare triple {914#true} assume true; {914#true} is VALID [2018-11-14 16:49:01,614 INFO L273 TraceCheckUtils]: 8: Hoare triple {914#true} assume !!~bvult32(~x~0, 10bv32);~y~0 := 0bv32; {914#true} is VALID [2018-11-14 16:49:01,614 INFO L273 TraceCheckUtils]: 9: Hoare triple {914#true} assume true; {914#true} is VALID [2018-11-14 16:49:01,614 INFO L273 TraceCheckUtils]: 10: Hoare triple {914#true} assume !!~bvult32(~y~0, 10bv32);~z~0 := 0bv32; {914#true} is VALID [2018-11-14 16:49:01,615 INFO L273 TraceCheckUtils]: 11: Hoare triple {914#true} assume true; {914#true} is VALID [2018-11-14 16:49:01,615 INFO L273 TraceCheckUtils]: 12: Hoare triple {914#true} assume !!~bvult32(~z~0, 10bv32);~v~0 := 0bv32; {955#(= main_~v~0 (_ bv0 32))} is VALID [2018-11-14 16:49:01,616 INFO L273 TraceCheckUtils]: 13: Hoare triple {955#(= main_~v~0 (_ bv0 32))} assume true; {955#(= main_~v~0 (_ bv0 32))} is VALID [2018-11-14 16:49:01,618 INFO L273 TraceCheckUtils]: 14: Hoare triple {955#(= main_~v~0 (_ bv0 32))} assume !!~bvult32(~v~0, 10bv32); {955#(= main_~v~0 (_ bv0 32))} is VALID [2018-11-14 16:49:01,620 INFO L273 TraceCheckUtils]: 15: Hoare triple {955#(= main_~v~0 (_ bv0 32))} #t~post4 := ~v~0;~v~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {965#(= (_ bv1 32) main_~v~0)} is VALID [2018-11-14 16:49:01,622 INFO L273 TraceCheckUtils]: 16: Hoare triple {965#(= (_ bv1 32) main_~v~0)} assume true; {965#(= (_ bv1 32) main_~v~0)} is VALID [2018-11-14 16:49:01,622 INFO L273 TraceCheckUtils]: 17: Hoare triple {965#(= (_ bv1 32) main_~v~0)} assume !!~bvult32(~v~0, 10bv32); {965#(= (_ bv1 32) main_~v~0)} is VALID [2018-11-14 16:49:01,623 INFO L273 TraceCheckUtils]: 18: Hoare triple {965#(= (_ bv1 32) main_~v~0)} #t~post4 := ~v~0;~v~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {975#(= (_ bv2 32) main_~v~0)} is VALID [2018-11-14 16:49:01,624 INFO L273 TraceCheckUtils]: 19: Hoare triple {975#(= (_ bv2 32) main_~v~0)} assume true; {975#(= (_ bv2 32) main_~v~0)} is VALID [2018-11-14 16:49:01,624 INFO L273 TraceCheckUtils]: 20: Hoare triple {975#(= (_ bv2 32) main_~v~0)} assume !!~bvult32(~v~0, 10bv32); {975#(= (_ bv2 32) main_~v~0)} is VALID [2018-11-14 16:49:01,625 INFO L273 TraceCheckUtils]: 21: Hoare triple {975#(= (_ bv2 32) main_~v~0)} #t~post4 := ~v~0;~v~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {985#(= (_ bv3 32) main_~v~0)} is VALID [2018-11-14 16:49:01,625 INFO L273 TraceCheckUtils]: 22: Hoare triple {985#(= (_ bv3 32) main_~v~0)} assume true; {985#(= (_ bv3 32) main_~v~0)} is VALID [2018-11-14 16:49:01,626 INFO L273 TraceCheckUtils]: 23: Hoare triple {985#(= (_ bv3 32) main_~v~0)} assume !!~bvult32(~v~0, 10bv32); {985#(= (_ bv3 32) main_~v~0)} is VALID [2018-11-14 16:49:01,626 INFO L273 TraceCheckUtils]: 24: Hoare triple {985#(= (_ bv3 32) main_~v~0)} #t~post4 := ~v~0;~v~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {995#(= (_ bv4 32) main_~v~0)} is VALID [2018-11-14 16:49:01,633 INFO L273 TraceCheckUtils]: 25: Hoare triple {995#(= (_ bv4 32) main_~v~0)} assume true; {995#(= (_ bv4 32) main_~v~0)} is VALID [2018-11-14 16:49:01,634 INFO L273 TraceCheckUtils]: 26: Hoare triple {995#(= (_ bv4 32) main_~v~0)} assume !~bvult32(~v~0, 10bv32); {915#false} is VALID [2018-11-14 16:49:01,634 INFO L256 TraceCheckUtils]: 27: Hoare triple {915#false} call __VERIFIER_assert(~bvurem32(~v~0, 4bv32)); {915#false} is VALID [2018-11-14 16:49:01,634 INFO L273 TraceCheckUtils]: 28: Hoare triple {915#false} ~cond := #in~cond; {915#false} is VALID [2018-11-14 16:49:01,634 INFO L273 TraceCheckUtils]: 29: Hoare triple {915#false} assume ~cond == 0bv32; {915#false} is VALID [2018-11-14 16:49:01,635 INFO L273 TraceCheckUtils]: 30: Hoare triple {915#false} assume !false; {915#false} is VALID [2018-11-14 16:49:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:49:01,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:49:01,892 INFO L273 TraceCheckUtils]: 30: Hoare triple {915#false} assume !false; {915#false} is VALID [2018-11-14 16:49:01,893 INFO L273 TraceCheckUtils]: 29: Hoare triple {1017#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {915#false} is VALID [2018-11-14 16:49:01,894 INFO L273 TraceCheckUtils]: 28: Hoare triple {1021#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1017#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 16:49:01,896 INFO L256 TraceCheckUtils]: 27: Hoare triple {1025#(not (= (bvurem main_~v~0 (_ bv4 32)) (_ bv0 32)))} call __VERIFIER_assert(~bvurem32(~v~0, 4bv32)); {1021#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 16:49:01,897 INFO L273 TraceCheckUtils]: 26: Hoare triple {1029#(or (bvult main_~v~0 (_ bv10 32)) (not (= (bvurem main_~v~0 (_ bv4 32)) (_ bv0 32))))} assume !~bvult32(~v~0, 10bv32); {1025#(not (= (bvurem main_~v~0 (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-14 16:49:01,898 INFO L273 TraceCheckUtils]: 25: Hoare triple {1029#(or (bvult main_~v~0 (_ bv10 32)) (not (= (bvurem main_~v~0 (_ bv4 32)) (_ bv0 32))))} assume true; {1029#(or (bvult main_~v~0 (_ bv10 32)) (not (= (bvurem main_~v~0 (_ bv4 32)) (_ bv0 32))))} is VALID [2018-11-14 16:49:01,900 INFO L273 TraceCheckUtils]: 24: Hoare triple {1036#(or (bvult (bvadd main_~v~0 (_ bv1 32)) (_ bv10 32)) (not (= (bvurem (bvadd main_~v~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32))))} #t~post4 := ~v~0;~v~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1029#(or (bvult main_~v~0 (_ bv10 32)) (not (= (bvurem main_~v~0 (_ bv4 32)) (_ bv0 32))))} is VALID [2018-11-14 16:49:01,902 INFO L273 TraceCheckUtils]: 23: Hoare triple {914#true} assume !!~bvult32(~v~0, 10bv32); {1036#(or (bvult (bvadd main_~v~0 (_ bv1 32)) (_ bv10 32)) (not (= (bvurem (bvadd main_~v~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32))))} is VALID [2018-11-14 16:49:01,903 INFO L273 TraceCheckUtils]: 22: Hoare triple {914#true} assume true; {914#true} is VALID [2018-11-14 16:49:01,903 INFO L273 TraceCheckUtils]: 21: Hoare triple {914#true} #t~post4 := ~v~0;~v~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {914#true} is VALID [2018-11-14 16:49:01,903 INFO L273 TraceCheckUtils]: 20: Hoare triple {914#true} assume !!~bvult32(~v~0, 10bv32); {914#true} is VALID [2018-11-14 16:49:01,904 INFO L273 TraceCheckUtils]: 19: Hoare triple {914#true} assume true; {914#true} is VALID [2018-11-14 16:49:01,904 INFO L273 TraceCheckUtils]: 18: Hoare triple {914#true} #t~post4 := ~v~0;~v~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {914#true} is VALID [2018-11-14 16:49:01,905 INFO L273 TraceCheckUtils]: 17: Hoare triple {914#true} assume !!~bvult32(~v~0, 10bv32); {914#true} is VALID [2018-11-14 16:49:01,905 INFO L273 TraceCheckUtils]: 16: Hoare triple {914#true} assume true; {914#true} is VALID [2018-11-14 16:49:01,905 INFO L273 TraceCheckUtils]: 15: Hoare triple {914#true} #t~post4 := ~v~0;~v~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {914#true} is VALID [2018-11-14 16:49:01,906 INFO L273 TraceCheckUtils]: 14: Hoare triple {914#true} assume !!~bvult32(~v~0, 10bv32); {914#true} is VALID [2018-11-14 16:49:01,906 INFO L273 TraceCheckUtils]: 13: Hoare triple {914#true} assume true; {914#true} is VALID [2018-11-14 16:49:01,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {914#true} assume !!~bvult32(~z~0, 10bv32);~v~0 := 0bv32; {914#true} is VALID [2018-11-14 16:49:01,907 INFO L273 TraceCheckUtils]: 11: Hoare triple {914#true} assume true; {914#true} is VALID [2018-11-14 16:49:01,907 INFO L273 TraceCheckUtils]: 10: Hoare triple {914#true} assume !!~bvult32(~y~0, 10bv32);~z~0 := 0bv32; {914#true} is VALID [2018-11-14 16:49:01,907 INFO L273 TraceCheckUtils]: 9: Hoare triple {914#true} assume true; {914#true} is VALID [2018-11-14 16:49:01,907 INFO L273 TraceCheckUtils]: 8: Hoare triple {914#true} assume !!~bvult32(~x~0, 10bv32);~y~0 := 0bv32; {914#true} is VALID [2018-11-14 16:49:01,908 INFO L273 TraceCheckUtils]: 7: Hoare triple {914#true} assume true; {914#true} is VALID [2018-11-14 16:49:01,908 INFO L273 TraceCheckUtils]: 6: Hoare triple {914#true} assume !!~bvult32(~w~0, 268435455bv32);~x~0 := 0bv32; {914#true} is VALID [2018-11-14 16:49:01,908 INFO L273 TraceCheckUtils]: 5: Hoare triple {914#true} assume true; {914#true} is VALID [2018-11-14 16:49:01,909 INFO L273 TraceCheckUtils]: 4: Hoare triple {914#true} ~x~0 := 0bv32;~y~0 := 0bv32;~z~0 := 0bv32;~w~0 := 0bv32;~v~0 := 0bv32;~w~0 := 0bv32; {914#true} is VALID [2018-11-14 16:49:01,909 INFO L256 TraceCheckUtils]: 3: Hoare triple {914#true} call #t~ret5 := main(); {914#true} is VALID [2018-11-14 16:49:01,909 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {914#true} {914#true} #86#return; {914#true} is VALID [2018-11-14 16:49:01,909 INFO L273 TraceCheckUtils]: 1: Hoare triple {914#true} assume true; {914#true} is VALID [2018-11-14 16:49:01,910 INFO L256 TraceCheckUtils]: 0: Hoare triple {914#true} call ULTIMATE.init(); {914#true} is VALID [2018-11-14 16:49:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 16:49:01,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 16:49:01,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2018-11-14 16:49:01,925 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-14 16:49:01,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:49:01,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:49:01,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:49:01,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:49:01,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:49:01,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:49:01,988 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 12 states. [2018-11-14 16:49:03,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:49:03,375 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2018-11-14 16:49:03,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 16:49:03,376 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-14 16:49:03,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:49:03,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:49:03,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 107 transitions. [2018-11-14 16:49:03,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:49:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 107 transitions. [2018-11-14 16:49:03,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 107 transitions. [2018-11-14 16:49:03,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:49:03,612 INFO L225 Difference]: With dead ends: 100 [2018-11-14 16:49:03,612 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 16:49:03,613 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:49:03,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 16:49:03,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 16:49:03,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:49:03,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 16:49:03,614 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:49:03,615 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:49:03,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:49:03,615 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:49:03,615 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:49:03,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:49:03,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:49:03,616 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:49:03,616 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:49:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:49:03,616 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:49:03,617 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:49:03,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:49:03,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:49:03,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:49:03,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:49:03,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 16:49:03,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 16:49:03,618 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-11-14 16:49:03,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:49:03,618 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 16:49:03,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:49:03,619 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:49:03,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:49:03,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 16:49:04,003 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 16:49:04,003 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:49:04,003 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:49:04,003 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 16:49:04,003 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 16:49:04,003 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 16:49:04,003 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 23) no Hoare annotation was computed. [2018-11-14 16:49:04,004 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 19 22) no Hoare annotation was computed. [2018-11-14 16:49:04,004 INFO L421 ceAbstractionStarter]: At program point L19-3(lines 19 22) the Hoare annotation is: (or (= main_~v~0 (_ bv0 32)) (not (= (bvurem main_~v~0 (_ bv4 32)) (_ bv0 32)))) [2018-11-14 16:49:04,004 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-14 16:49:04,004 INFO L425 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-11-14 16:49:04,004 INFO L421 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (or (bvult main_~v~0 (_ bv10 32)) (not (= (bvurem main_~v~0 (_ bv4 32)) (_ bv0 32)))) [2018-11-14 16:49:04,004 INFO L425 ceAbstractionStarter]: For program point L16-1(lines 16 22) no Hoare annotation was computed. [2018-11-14 16:49:04,004 INFO L421 ceAbstractionStarter]: At program point L20-5(line 20) the Hoare annotation is: (not (= (bvurem main_~v~0 (_ bv4 32)) (_ bv0 32))) [2018-11-14 16:49:04,005 INFO L425 ceAbstractionStarter]: For program point L16-3(lines 16 22) no Hoare annotation was computed. [2018-11-14 16:49:04,005 INFO L421 ceAbstractionStarter]: At program point L16-4(lines 16 22) the Hoare annotation is: (or (= main_~v~0 (_ bv0 32)) (not (= (bvurem main_~v~0 (_ bv4 32)) (_ bv0 32)))) [2018-11-14 16:49:04,005 INFO L425 ceAbstractionStarter]: For program point L16-5(lines 10 23) no Hoare annotation was computed. [2018-11-14 16:49:04,005 INFO L425 ceAbstractionStarter]: For program point L21(lines 19 22) no Hoare annotation was computed. [2018-11-14 16:49:04,005 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 17 22) no Hoare annotation was computed. [2018-11-14 16:49:04,005 INFO L425 ceAbstractionStarter]: For program point L17-3(lines 17 22) no Hoare annotation was computed. [2018-11-14 16:49:04,005 INFO L421 ceAbstractionStarter]: At program point L17-4(lines 17 22) the Hoare annotation is: (or (= main_~v~0 (_ bv0 32)) (not (= (bvurem main_~v~0 (_ bv4 32)) (_ bv0 32)))) [2018-11-14 16:49:04,005 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 23) the Hoare annotation is: true [2018-11-14 16:49:04,005 INFO L425 ceAbstractionStarter]: For program point L18-1(lines 18 22) no Hoare annotation was computed. [2018-11-14 16:49:04,006 INFO L425 ceAbstractionStarter]: For program point L18-3(lines 18 22) no Hoare annotation was computed. [2018-11-14 16:49:04,006 INFO L421 ceAbstractionStarter]: At program point L18-4(lines 18 22) the Hoare annotation is: (or (= main_~v~0 (_ bv0 32)) (not (= (bvurem main_~v~0 (_ bv4 32)) (_ bv0 32)))) [2018-11-14 16:49:04,006 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-14 16:49:04,006 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-14 16:49:04,006 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-14 16:49:04,006 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-14 16:49:04,006 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-14 16:49:04,007 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-14 16:49:04,008 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:49:04,010 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 16:49:04,010 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:49:04,010 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:49:04,010 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2018-11-14 16:49:04,010 WARN L170 areAnnotationChecker]: L16-5 has no Hoare annotation [2018-11-14 16:49:04,010 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 16:49:04,011 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 16:49:04,011 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:49:04,011 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2018-11-14 16:49:04,011 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2018-11-14 16:49:04,011 WARN L170 areAnnotationChecker]: L16-5 has no Hoare annotation [2018-11-14 16:49:04,011 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 16:49:04,011 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 16:49:04,011 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-14 16:49:04,011 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-14 16:49:04,011 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2018-11-14 16:49:04,012 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 16:49:04,012 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 16:49:04,012 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-14 16:49:04,012 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-14 16:49:04,012 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2018-11-14 16:49:04,012 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 16:49:04,012 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-14 16:49:04,012 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2018-11-14 16:49:04,012 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-14 16:49:04,012 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2018-11-14 16:49:04,012 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-14 16:49:04,013 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-14 16:49:04,013 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2018-11-14 16:49:04,013 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-14 16:49:04,013 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-14 16:49:04,013 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2018-11-14 16:49:04,013 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2018-11-14 16:49:04,014 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2018-11-14 16:49:04,014 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2018-11-14 16:49:04,014 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 16:49:04,014 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2018-11-14 16:49:04,014 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 16:49:04,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:49:04 BoogieIcfgContainer [2018-11-14 16:49:04,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 16:49:04,026 INFO L168 Benchmark]: Toolchain (without parser) took 6837.93 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 716.7 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -359.4 MB). Peak memory consumption was 357.3 MB. Max. memory is 7.1 GB. [2018-11-14 16:49:04,028 INFO L168 Benchmark]: CDTParser took 0.23 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 16:49:04,029 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.98 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 16:49:04,030 INFO L168 Benchmark]: Boogie Preprocessor took 48.45 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 16:49:04,030 INFO L168 Benchmark]: RCFGBuilder took 695.66 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 716.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -748.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-14 16:49:04,031 INFO L168 Benchmark]: TraceAbstraction took 5737.17 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 378.4 MB). Peak memory consumption was 378.4 MB. Max. memory is 7.1 GB. [2018-11-14 16:49:04,035 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.23 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 351.98 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 48.45 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 695.66 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 716.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -748.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5737.17 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 378.4 MB). Peak memory consumption was 378.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 16]: Loop Invariant Derived loop invariant: v == 0bv32 || !(~bvurem32(v, 4bv32) == 0bv32) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: v == 0bv32 || !(~bvurem32(v, 4bv32) == 0bv32) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: v == 0bv32 || !(~bvurem32(v, 4bv32) == 0bv32) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ~bvult32(v, 10bv32) || !(~bvurem32(v, 4bv32) == 0bv32) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: v == 0bv32 || !(~bvurem32(v, 4bv32) == 0bv32) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. SAFE Result, 5.6s OverallTime, 4 OverallIterations, 5 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 135 SDtfs, 125 SDslu, 348 SDs, 0 SdLazy, 129 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=3, 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, 23 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 16 PreInvPairs, 37 NumberOfFragments, 61 HoareAnnotationTreeSize, 16 FomulaSimplifications, 146 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 6013 SizeOfPredicates, 2 NumberOfNonLiveVariables, 154 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 26/56 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...