java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-acceleration/simple_true-unreach-call4.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:30:39,499 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:30:39,501 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:30:39,518 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:30:39,519 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:30:39,521 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:30:39,522 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:30:39,524 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:30:39,527 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:30:39,529 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:30:39,531 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:30:39,531 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:30:39,533 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:30:39,534 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:30:39,537 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:30:39,538 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:30:39,539 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:30:39,540 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:30:39,554 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:30:39,556 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:30:39,557 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:30:39,558 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:30:39,560 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:30:39,560 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:30:39,560 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:30:39,561 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:30:39,562 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:30:39,563 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:30:39,564 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:30:39,565 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:30:39,565 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:30:39,566 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:30:39,566 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:30:39,566 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:30:39,567 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:30:39,569 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:30:39,569 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:30:39,584 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:30:39,584 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:30:39,585 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:30:39,585 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:30:39,586 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:30:39,586 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:30:39,586 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:30:39,586 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:30:39,586 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:30:39,587 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:30:39,587 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:30:39,587 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:30:39,587 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:30:39,587 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:30:39,588 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:30:39,588 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:30:39,588 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:30:39,588 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:30:39,588 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:30:39,588 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:30:39,589 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:30:39,589 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:30:39,589 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:30:39,589 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:30:39,589 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:30:39,590 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:30:39,590 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:30:39,590 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:30:39,590 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:30:39,590 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:30:39,591 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:30:39,591 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:30:39,591 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:30:39,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:30:39,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:30:39,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:30:39,662 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:30:39,662 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:30:39,663 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_true-unreach-call4.i [2018-11-23 11:30:39,723 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad0fc1701/6df518e338234cf69c65c16b0fc992ad/FLAG78e872dfc [2018-11-23 11:30:40,116 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:30:40,116 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_true-unreach-call4.i [2018-11-23 11:30:40,123 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad0fc1701/6df518e338234cf69c65c16b0fc992ad/FLAG78e872dfc [2018-11-23 11:30:40,496 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad0fc1701/6df518e338234cf69c65c16b0fc992ad [2018-11-23 11:30:40,506 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:30:40,507 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:30:40,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:30:40,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:30:40,512 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:30:40,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:40" (1/1) ... [2018-11-23 11:30:40,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17278fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40, skipping insertion in model container [2018-11-23 11:30:40,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:40" (1/1) ... [2018-11-23 11:30:40,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:30:40,555 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:30:40,802 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:30:40,808 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:30:40,822 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:30:40,840 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:30:40,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40 WrapperNode [2018-11-23 11:30:40,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:30:40,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:30:40,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:30:40,842 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:30:40,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40" (1/1) ... [2018-11-23 11:30:40,859 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40" (1/1) ... [2018-11-23 11:30:40,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:30:40,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:30:40,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:30:40,869 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:30:40,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40" (1/1) ... [2018-11-23 11:30:40,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40" (1/1) ... [2018-11-23 11:30:40,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40" (1/1) ... [2018-11-23 11:30:40,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40" (1/1) ... [2018-11-23 11:30:40,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40" (1/1) ... [2018-11-23 11:30:40,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40" (1/1) ... [2018-11-23 11:30:40,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40" (1/1) ... [2018-11-23 11:30:40,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:30:40,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:30:40,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:30:40,898 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:30:40,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:30:41,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:30:41,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:30:41,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:30:41,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:30:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:30:41,022 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:30:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:30:41,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:30:41,366 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:30:41,366 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:30:41,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:41 BoogieIcfgContainer [2018-11-23 11:30:41,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:30:41,368 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:30:41,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:30:41,371 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:30:41,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:30:40" (1/3) ... [2018-11-23 11:30:41,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1b6d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:41, skipping insertion in model container [2018-11-23 11:30:41,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40" (2/3) ... [2018-11-23 11:30:41,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1b6d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:41, skipping insertion in model container [2018-11-23 11:30:41,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:41" (3/3) ... [2018-11-23 11:30:41,375 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call4.i [2018-11-23 11:30:41,383 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:30:41,390 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:30:41,408 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:30:41,442 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:30:41,443 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:30:41,444 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:30:41,444 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:30:41,444 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:30:41,444 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:30:41,444 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:30:41,445 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:30:41,445 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:30:41,462 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 11:30:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:30:41,468 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:41,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:41,472 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:41,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:41,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2018-11-23 11:30:41,483 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:41,483 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:30:41,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:30:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:41,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:41,690 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-23 11:30:41,694 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-23 11:30:41,695 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} #31#return; {20#true} is VALID [2018-11-23 11:30:41,695 INFO L256 TraceCheckUtils]: 3: Hoare triple {20#true} call #t~ret0 := main(); {20#true} is VALID [2018-11-23 11:30:41,698 INFO L273 TraceCheckUtils]: 4: Hoare triple {20#true} ~x~0 := 268435440bv32; {37#(= (bvadd main_~x~0 (_ bv4026531856 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:41,700 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#(= (bvadd main_~x~0 (_ bv4026531856 32)) (_ bv0 32))} assume !~bvugt32(~x~0, 0bv32); {21#false} is VALID [2018-11-23 11:30:41,701 INFO L256 TraceCheckUtils]: 6: Hoare triple {21#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {21#false} is VALID [2018-11-23 11:30:41,701 INFO L273 TraceCheckUtils]: 7: Hoare triple {21#false} ~cond := #in~cond; {21#false} is VALID [2018-11-23 11:30:41,701 INFO L273 TraceCheckUtils]: 8: Hoare triple {21#false} assume 0bv32 == ~cond; {21#false} is VALID [2018-11-23 11:30:41,702 INFO L273 TraceCheckUtils]: 9: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-23 11:30:41,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:41,705 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:30:41,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:30:41,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:30:41,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:30:41,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:41,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:30:41,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:41,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:30:41,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:30:41,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:30:41,770 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-11-23 11:30:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:41,925 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 11:30:41,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:30:41,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:30:41,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:30:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:30:41,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 11:30:41,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:30:41,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 11:30:41,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2018-11-23 11:30:42,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:42,264 INFO L225 Difference]: With dead ends: 29 [2018-11-23 11:30:42,264 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 11:30:42,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:30:42,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 11:30:42,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 11:30:42,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:30:42,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 11:30:42,325 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:30:42,325 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:30:42,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:42,329 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:30:42,329 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:30:42,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:42,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:42,330 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:30:42,330 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:30:42,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:42,333 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:30:42,333 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:30:42,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:42,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:42,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:30:42,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:30:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:30:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 11:30:42,338 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 11:30:42,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:30:42,339 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 11:30:42,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:30:42,339 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:30:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:30:42,340 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:42,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:42,340 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:42,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:42,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2018-11-23 11:30:42,341 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:42,341 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:30:42,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:30:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:42,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:42,463 INFO L256 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {135#true} is VALID [2018-11-23 11:30:42,463 INFO L273 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2018-11-23 11:30:42,463 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #31#return; {135#true} is VALID [2018-11-23 11:30:42,464 INFO L256 TraceCheckUtils]: 3: Hoare triple {135#true} call #t~ret0 := main(); {135#true} is VALID [2018-11-23 11:30:42,473 INFO L273 TraceCheckUtils]: 4: Hoare triple {135#true} ~x~0 := 268435440bv32; {152#(= (bvadd main_~x~0 (_ bv4026531856 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:42,486 INFO L273 TraceCheckUtils]: 5: Hoare triple {152#(= (bvadd main_~x~0 (_ bv4026531856 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 0bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {156#(= (bvadd main_~x~0 (_ bv4026531858 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:42,499 INFO L273 TraceCheckUtils]: 6: Hoare triple {156#(= (bvadd main_~x~0 (_ bv4026531858 32)) (_ bv0 32))} assume !~bvugt32(~x~0, 0bv32); {136#false} is VALID [2018-11-23 11:30:42,500 INFO L256 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {136#false} is VALID [2018-11-23 11:30:42,500 INFO L273 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2018-11-23 11:30:42,500 INFO L273 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0bv32 == ~cond; {136#false} is VALID [2018-11-23 11:30:42,501 INFO L273 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2018-11-23 11:30:42,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:42,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:30:42,678 INFO L273 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2018-11-23 11:30:42,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0bv32 == ~cond; {136#false} is VALID [2018-11-23 11:30:42,679 INFO L273 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2018-11-23 11:30:42,679 INFO L256 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {136#false} is VALID [2018-11-23 11:30:42,681 INFO L273 TraceCheckUtils]: 6: Hoare triple {184#(bvugt main_~x~0 (_ bv0 32))} assume !~bvugt32(~x~0, 0bv32); {136#false} is VALID [2018-11-23 11:30:42,683 INFO L273 TraceCheckUtils]: 5: Hoare triple {188#(bvugt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 0bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {184#(bvugt main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:30:42,686 INFO L273 TraceCheckUtils]: 4: Hoare triple {135#true} ~x~0 := 268435440bv32; {188#(bvugt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:42,686 INFO L256 TraceCheckUtils]: 3: Hoare triple {135#true} call #t~ret0 := main(); {135#true} is VALID [2018-11-23 11:30:42,686 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #31#return; {135#true} is VALID [2018-11-23 11:30:42,687 INFO L273 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2018-11-23 11:30:42,687 INFO L256 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {135#true} is VALID [2018-11-23 11:30:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:42,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:30:42,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:30:42,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 11:30:42,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:42,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:30:42,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:42,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:30:42,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:30:42,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:30:42,722 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 6 states. [2018-11-23 11:30:42,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:42,885 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 11:30:42,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:30:42,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 11:30:42,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:30:42,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:30:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-23 11:30:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:30:42,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-23 11:30:42,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 22 transitions. [2018-11-23 11:30:43,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:43,032 INFO L225 Difference]: With dead ends: 20 [2018-11-23 11:30:43,032 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 11:30:43,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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-23 11:30:43,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 11:30:43,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 11:30:43,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:30:43,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 11:30:43,208 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:30:43,208 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:30:43,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:43,211 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:30:43,211 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:30:43,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:43,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:43,212 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:30:43,212 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:30:43,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:43,214 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:30:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:30:43,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:43,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:43,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:30:43,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:30:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:30:43,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 11:30:43,218 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-11-23 11:30:43,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:30:43,218 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 11:30:43,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:30:43,218 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:30:43,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:30:43,219 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:43,219 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:43,220 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:43,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:43,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 2 times [2018-11-23 11:30:43,221 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:43,221 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:30:43,250 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:30:43,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:30:43,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:30:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:43,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:43,476 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-23 11:30:43,476 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-23 11:30:43,477 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {297#true} {297#true} #31#return; {297#true} is VALID [2018-11-23 11:30:43,477 INFO L256 TraceCheckUtils]: 3: Hoare triple {297#true} call #t~ret0 := main(); {297#true} is VALID [2018-11-23 11:30:43,477 INFO L273 TraceCheckUtils]: 4: Hoare triple {297#true} ~x~0 := 268435440bv32; {297#true} is VALID [2018-11-23 11:30:43,478 INFO L273 TraceCheckUtils]: 5: Hoare triple {297#true} assume !!~bvugt32(~x~0, 0bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {297#true} is VALID [2018-11-23 11:30:43,478 INFO L273 TraceCheckUtils]: 6: Hoare triple {297#true} assume !!~bvugt32(~x~0, 0bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {297#true} is VALID [2018-11-23 11:30:43,480 INFO L273 TraceCheckUtils]: 7: Hoare triple {297#true} assume !!~bvugt32(~x~0, 0bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {297#true} is VALID [2018-11-23 11:30:43,480 INFO L273 TraceCheckUtils]: 8: Hoare triple {297#true} assume !!~bvugt32(~x~0, 0bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {297#true} is VALID [2018-11-23 11:30:43,486 INFO L273 TraceCheckUtils]: 9: Hoare triple {297#true} assume !~bvugt32(~x~0, 0bv32); {329#(not (bvugt main_~x~0 (_ bv0 32)))} is VALID [2018-11-23 11:30:43,488 INFO L256 TraceCheckUtils]: 10: Hoare triple {329#(not (bvugt main_~x~0 (_ bv0 32)))} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {333#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:43,488 INFO L273 TraceCheckUtils]: 11: Hoare triple {333#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {337#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:43,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {337#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {298#false} is VALID [2018-11-23 11:30:43,496 INFO L273 TraceCheckUtils]: 13: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-23 11:30:43,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 11:30:43,498 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:30:43,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:30:43,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:30:43,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 11:30:43,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:43,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:30:43,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:43,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:30:43,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:30:43,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:30:43,526 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2018-11-23 11:30:43,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:43,740 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:30:43,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:30:43,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 11:30:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:30:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:30:43,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-23 11:30:43,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:30:43,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-23 11:30:43,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 11 transitions. [2018-11-23 11:30:43,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:43,801 INFO L225 Difference]: With dead ends: 15 [2018-11-23 11:30:43,801 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:30:43,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:30:43,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:30:43,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:30:43,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:30:43,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:30:43,803 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:30:43,804 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:30:43,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:43,804 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:30:43,805 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:30:43,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:43,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:43,805 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:30:43,805 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:30:43,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:43,806 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:30:43,806 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:30:43,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:43,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:43,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:30:43,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:30:43,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:30:43,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:30:43,807 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-11-23 11:30:43,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:30:43,808 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:30:43,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:30:43,808 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:30:43,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:43,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:30:44,124 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 11:30:44,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:30:44,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:30:44,125 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:30:44,125 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:30:44,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:30:44,125 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 8 14) the Hoare annotation is: true [2018-11-23 11:30:44,125 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 8 14) no Hoare annotation was computed. [2018-11-23 11:30:44,126 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 8 14) no Hoare annotation was computed. [2018-11-23 11:30:44,126 INFO L451 ceAbstractionStarter]: At program point L10-2(lines 10 12) the Hoare annotation is: true [2018-11-23 11:30:44,126 INFO L444 ceAbstractionStarter]: At program point L10-3(lines 10 12) the Hoare annotation is: (not (bvugt main_~x~0 (_ bv0 32))) [2018-11-23 11:30:44,126 INFO L448 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-11-23 11:30:44,126 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-11-23 11:30:44,126 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-11-23 11:30:44,126 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-23 11:30:44,127 INFO L448 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-23 11:30:44,127 INFO L448 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-11-23 11:30:44,128 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:30:44,129 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:30:44,129 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:30:44,129 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:30:44,130 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:30:44,130 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:30:44,130 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:30:44,130 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:30:44,130 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:30:44,131 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:30:44,131 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-23 11:30:44,131 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:30:44,131 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:30:44,131 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:30:44,131 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:30:44,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:30:44 BoogieIcfgContainer [2018-11-23 11:30:44,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:30:44,136 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:30:44,136 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:30:44,136 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:30:44,137 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:41" (3/4) ... [2018-11-23 11:30:44,141 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:30:44,147 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:30:44,148 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:30:44,148 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:30:44,152 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 11:30:44,152 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 11:30:44,152 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:30:44,192 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-acceleration/simple_true-unreach-call4.i-witness.graphml [2018-11-23 11:30:44,193 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:30:44,194 INFO L168 Benchmark]: Toolchain (without parser) took 3687.68 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 701.0 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -607.4 MB). Peak memory consumption was 93.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:30:44,195 INFO L168 Benchmark]: CDTParser took 0.21 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-23 11:30:44,196 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.93 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-23 11:30:44,197 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.42 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-23 11:30:44,197 INFO L168 Benchmark]: Boogie Preprocessor took 28.71 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-23 11:30:44,198 INFO L168 Benchmark]: RCFGBuilder took 469.31 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 701.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -753.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:30:44,199 INFO L168 Benchmark]: TraceAbstraction took 2767.66 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 135.9 MB). Peak memory consumption was 135.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:30:44,200 INFO L168 Benchmark]: Witness Printer took 56.49 ms. Allocated memory is still 2.2 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:30:44,205 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 332.93 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 Procedure Inliner took 27.42 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. * Boogie Preprocessor took 28.71 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 469.31 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 701.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -753.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2767.66 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 135.9 MB). Peak memory consumption was 135.9 MB. Max. memory is 7.1 GB. * Witness Printer took 56.49 ms. Allocated memory is still 2.2 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 10]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 17 locations, 1 error locations. SAFE Result, 2.6s OverallTime, 3 OverallIterations, 4 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 34 SDtfs, 1 SDslu, 58 SDs, 0 SdLazy, 17 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, 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.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 10 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 35 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 769 SizeOfPredicates, 4 NumberOfNonLiveVariables, 56 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 10/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...