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/array-examples/sanfoundry_24_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:02:14,667 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:02:14,669 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:02:14,687 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:02:14,687 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:02:14,689 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:02:14,690 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:02:14,694 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:02:14,697 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:02:14,705 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:02:14,706 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:02:14,706 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:02:14,707 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:02:14,711 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:02:14,712 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:02:14,718 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:02:14,720 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:02:14,723 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:02:14,728 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:02:14,730 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:02:14,733 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:02:14,735 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:02:14,739 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:02:14,740 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:02:14,740 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:02:14,741 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:02:14,744 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:02:14,745 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:02:14,745 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:02:14,746 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:02:14,748 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:02:14,749 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:02:14,749 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:02:14,749 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:02:14,752 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:02:14,754 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:02:14,754 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 10:02:14,782 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:02:14,782 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:02:14,784 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:02:14,784 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:02:14,788 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:02:14,788 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:02:14,788 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:02:14,789 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:02:14,789 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:02:14,789 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:02:14,789 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:02:14,791 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:02:14,791 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:02:14,791 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:02:14,791 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:02:14,792 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:02:14,792 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:02:14,792 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:02:14,792 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:02:14,792 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:02:14,794 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:02:14,794 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:02:14,794 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:02:14,795 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:02:14,795 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:02:14,795 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:02:14,796 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:02:14,796 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:02:14,796 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:02:14,796 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:02:14,796 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:02:14,797 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:02:14,797 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:02:14,844 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:02:14,859 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:02:14,862 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:02:14,864 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:02:14,865 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:02:14,866 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_24_true-unreach-call_true-termination.i [2018-11-23 10:02:14,939 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/073f6be69/fd7d8aebc6034afcb7f7fdf3f52f5abb/FLAG5869d375d [2018-11-23 10:02:15,455 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:02:15,456 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_24_true-unreach-call_true-termination.i [2018-11-23 10:02:15,462 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/073f6be69/fd7d8aebc6034afcb7f7fdf3f52f5abb/FLAG5869d375d [2018-11-23 10:02:15,785 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/073f6be69/fd7d8aebc6034afcb7f7fdf3f52f5abb [2018-11-23 10:02:15,795 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:02:15,797 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:02:15,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:02:15,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:02:15,802 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:02:15,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:02:15" (1/1) ... [2018-11-23 10:02:15,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e3a4b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:15, skipping insertion in model container [2018-11-23 10:02:15,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:02:15" (1/1) ... [2018-11-23 10:02:15,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:02:15,843 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:02:16,125 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:02:16,133 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:02:16,172 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:02:16,206 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:02:16,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:16 WrapperNode [2018-11-23 10:02:16,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:02:16,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:02:16,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:02:16,209 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:02:16,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:16" (1/1) ... [2018-11-23 10:02:16,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:16" (1/1) ... [2018-11-23 10:02:16,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:02:16,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:02:16,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:02:16,243 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:02:16,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:16" (1/1) ... [2018-11-23 10:02:16,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:16" (1/1) ... [2018-11-23 10:02:16,256 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:16" (1/1) ... [2018-11-23 10:02:16,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:16" (1/1) ... [2018-11-23 10:02:16,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:16" (1/1) ... [2018-11-23 10:02:16,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:16" (1/1) ... [2018-11-23 10:02:16,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:16" (1/1) ... [2018-11-23 10:02:16,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:02:16,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:02:16,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:02:16,283 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:02:16,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:16" (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 10:02:16,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:02:16,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:02:16,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:02:16,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:02:16,418 INFO L130 BoogieDeclarations]: Found specification of procedure printOdd [2018-11-23 10:02:16,418 INFO L138 BoogieDeclarations]: Found implementation of procedure printOdd [2018-11-23 10:02:16,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:02:16,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:02:16,419 INFO L130 BoogieDeclarations]: Found specification of procedure printEven [2018-11-23 10:02:16,419 INFO L138 BoogieDeclarations]: Found implementation of procedure printEven [2018-11-23 10:02:16,419 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:02:16,419 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:02:16,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:02:16,420 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:02:16,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:02:17,046 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:02:17,046 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 10:02:17,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:17 BoogieIcfgContainer [2018-11-23 10:02:17,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:02:17,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:02:17,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:02:17,052 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:02:17,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:02:15" (1/3) ... [2018-11-23 10:02:17,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ff9248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:02:17, skipping insertion in model container [2018-11-23 10:02:17,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:16" (2/3) ... [2018-11-23 10:02:17,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ff9248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:02:17, skipping insertion in model container [2018-11-23 10:02:17,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:17" (3/3) ... [2018-11-23 10:02:17,056 INFO L112 eAbstractionObserver]: Analyzing ICFG sanfoundry_24_true-unreach-call_true-termination.i [2018-11-23 10:02:17,068 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:02:17,077 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:02:17,097 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:02:17,132 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:02:17,133 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:02:17,134 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:02:17,134 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:02:17,134 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:02:17,135 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:02:17,135 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:02:17,135 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:02:17,135 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:02:17,154 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-23 10:02:17,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 10:02:17,162 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:17,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:17,165 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:17,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:17,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1836635640, now seen corresponding path program 1 times [2018-11-23 10:02:17,177 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:17,178 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 10:02:17,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:17,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:17,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-23 10:02:17,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2018-11-23 10:02:17,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:02:17,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:02:17,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:02:17,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-11-23 10:02:17,714 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:02:17,715 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#array~0.base|, |main_~#array~0.offset|, main_~i~0]. (let ((.cse0 (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~i~0))))) (and (= .cse0 |main_#t~mem3|) (= (_ bv0 32) (bvsrem .cse0 (_ bv2 32))))) [2018-11-23 10:02:17,715 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (bvsrem |main_#t~mem3| (_ bv2 32)) (_ bv0 32)) [2018-11-23 10:02:18,137 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-23 10:02:18,141 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {39#true} is VALID [2018-11-23 10:02:18,141 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 10:02:18,141 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #69#return; {39#true} is VALID [2018-11-23 10:02:18,142 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret7 := main(); {39#true} is VALID [2018-11-23 10:02:18,142 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~num~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32; {39#true} is VALID [2018-11-23 10:02:18,144 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume !!~bvslt32(~i~0, ~num~0);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {62#(= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~i~0))) |main_#t~mem2|)} is VALID [2018-11-23 10:02:18,162 INFO L273 TraceCheckUtils]: 7: Hoare triple {62#(= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~i~0))) |main_#t~mem2|)} assume 0bv32 == ~bvsrem32(#t~mem2, 2bv32);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {66#(= (bvsrem |main_#t~mem3| (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:18,173 INFO L256 TraceCheckUtils]: 8: Hoare triple {66#(= (bvsrem |main_#t~mem3| (_ bv2 32)) (_ bv0 32))} call printEven(#t~mem3); {70#(= (_ bv0 32) (bvsrem |printEven_#in~i| (_ bv2 32)))} is VALID [2018-11-23 10:02:18,186 INFO L273 TraceCheckUtils]: 9: Hoare triple {70#(= (_ bv0 32) (bvsrem |printEven_#in~i| (_ bv2 32)))} ~i := #in~i; {74#(= (bvsrem printEven_~i (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:18,195 INFO L256 TraceCheckUtils]: 10: Hoare triple {74#(= (bvsrem printEven_~i (_ bv2 32)) (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == ~bvsrem32(~i, 2bv32) then 1bv32 else 0bv32)); {78#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:18,201 INFO L273 TraceCheckUtils]: 11: Hoare triple {78#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {82#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:18,202 INFO L273 TraceCheckUtils]: 12: Hoare triple {82#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {40#false} is VALID [2018-11-23 10:02:18,203 INFO L273 TraceCheckUtils]: 13: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-23 10:02:18,209 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 10:02:18,210 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:18,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:18,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 10:02:18,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-23 10:02:18,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:18,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 10:02:18,372 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 10:02:18,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 10:02:18,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 10:02:18,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 10:02:18,385 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 8 states. [2018-11-23 10:02:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:20,030 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2018-11-23 10:02:20,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 10:02:20,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-23 10:02:20,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:02:20,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2018-11-23 10:02:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:02:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2018-11-23 10:02:20,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 88 transitions. [2018-11-23 10:02:20,279 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:20,293 INFO L225 Difference]: With dead ends: 70 [2018-11-23 10:02:20,293 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 10:02:20,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 10:02:20,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 10:02:20,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 10:02:20,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:20,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-23 10:02:20,386 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 10:02:20,386 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 10:02:20,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:20,392 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-23 10:02:20,392 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 10:02:20,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:20,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:20,394 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 10:02:20,394 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 10:02:20,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:20,399 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-23 10:02:20,399 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 10:02:20,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:20,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:20,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:20,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 10:02:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-23 10:02:20,407 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 14 [2018-11-23 10:02:20,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:20,407 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-23 10:02:20,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 10:02:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 10:02:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:02:20,409 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:20,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:20,409 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:20,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:20,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1211296837, now seen corresponding path program 1 times [2018-11-23 10:02:20,411 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:20,411 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 10:02:20,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:20,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:20,628 INFO L256 TraceCheckUtils]: 0: Hoare triple {304#true} call ULTIMATE.init(); {304#true} is VALID [2018-11-23 10:02:20,629 INFO L273 TraceCheckUtils]: 1: Hoare triple {304#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {304#true} is VALID [2018-11-23 10:02:20,629 INFO L273 TraceCheckUtils]: 2: Hoare triple {304#true} assume true; {304#true} is VALID [2018-11-23 10:02:20,629 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {304#true} {304#true} #69#return; {304#true} is VALID [2018-11-23 10:02:20,630 INFO L256 TraceCheckUtils]: 4: Hoare triple {304#true} call #t~ret7 := main(); {304#true} is VALID [2018-11-23 10:02:20,630 INFO L273 TraceCheckUtils]: 5: Hoare triple {304#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~num~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32; {324#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:20,633 INFO L273 TraceCheckUtils]: 6: Hoare triple {324#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~num~0); {328#(not (bvslt (_ bv0 32) main_~num~0))} is VALID [2018-11-23 10:02:20,634 INFO L273 TraceCheckUtils]: 7: Hoare triple {328#(not (bvslt (_ bv0 32) main_~num~0))} ~i~0 := 0bv32; {332#(and (not (bvslt (_ bv0 32) main_~num~0)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:02:20,635 INFO L273 TraceCheckUtils]: 8: Hoare triple {332#(and (not (bvslt (_ bv0 32) main_~num~0)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~num~0);call #t~mem5 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {305#false} is VALID [2018-11-23 10:02:20,635 INFO L273 TraceCheckUtils]: 9: Hoare triple {305#false} assume 0bv32 != ~bvsrem32(#t~mem5, 2bv32);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {305#false} is VALID [2018-11-23 10:02:20,636 INFO L256 TraceCheckUtils]: 10: Hoare triple {305#false} call printOdd(#t~mem6); {305#false} is VALID [2018-11-23 10:02:20,636 INFO L273 TraceCheckUtils]: 11: Hoare triple {305#false} ~i := #in~i; {305#false} is VALID [2018-11-23 10:02:20,636 INFO L256 TraceCheckUtils]: 12: Hoare triple {305#false} call __VERIFIER_assert((if 0bv32 != ~bvsrem32(~i, 2bv32) then 1bv32 else 0bv32)); {305#false} is VALID [2018-11-23 10:02:20,636 INFO L273 TraceCheckUtils]: 13: Hoare triple {305#false} ~cond := #in~cond; {305#false} is VALID [2018-11-23 10:02:20,637 INFO L273 TraceCheckUtils]: 14: Hoare triple {305#false} assume 0bv32 == ~cond; {305#false} is VALID [2018-11-23 10:02:20,637 INFO L273 TraceCheckUtils]: 15: Hoare triple {305#false} assume !false; {305#false} is VALID [2018-11-23 10:02:20,638 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 10:02:20,638 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:20,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:20,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 10:02:20,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 10:02:20,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:20,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 10:02:20,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:20,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 10:02:20,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 10:02:20,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 10:02:20,672 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 5 states. [2018-11-23 10:02:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:20,945 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-11-23 10:02:20,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:02:20,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 10:02:20,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 10:02:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2018-11-23 10:02:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 10:02:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2018-11-23 10:02:20,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 68 transitions. [2018-11-23 10:02:21,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:21,115 INFO L225 Difference]: With dead ends: 62 [2018-11-23 10:02:21,116 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 10:02:21,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 10:02:21,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 10:02:21,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2018-11-23 10:02:21,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:21,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 36 states. [2018-11-23 10:02:21,140 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 36 states. [2018-11-23 10:02:21,141 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 36 states. [2018-11-23 10:02:21,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:21,146 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-23 10:02:21,146 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 10:02:21,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:21,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:21,148 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 45 states. [2018-11-23 10:02:21,148 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 45 states. [2018-11-23 10:02:21,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:21,155 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-23 10:02:21,156 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 10:02:21,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:21,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:21,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:21,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 10:02:21,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-11-23 10:02:21,162 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 16 [2018-11-23 10:02:21,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:21,163 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-11-23 10:02:21,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 10:02:21,163 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-23 10:02:21,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 10:02:21,164 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:21,164 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:21,164 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:21,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:21,165 INFO L82 PathProgramCache]: Analyzing trace with hash 308392718, now seen corresponding path program 1 times [2018-11-23 10:02:21,165 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:21,165 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 10:02:21,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:21,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:21,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-23 10:02:21,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2018-11-23 10:02:21,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:02:21,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:02:21,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:02:21,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:6 [2018-11-23 10:02:21,535 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:02:21,535 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#array~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#array~0.base|) (_ bv0 32)))) (and (not (= (_ bv0 32) (bvsrem .cse0 (_ bv2 32)))) (= .cse0 |main_#t~mem6|))) [2018-11-23 10:02:21,535 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= (bvsrem |main_#t~mem6| (_ bv2 32)) (_ bv0 32))) [2018-11-23 10:02:21,661 INFO L256 TraceCheckUtils]: 0: Hoare triple {583#true} call ULTIMATE.init(); {583#true} is VALID [2018-11-23 10:02:21,661 INFO L273 TraceCheckUtils]: 1: Hoare triple {583#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {583#true} is VALID [2018-11-23 10:02:21,661 INFO L273 TraceCheckUtils]: 2: Hoare triple {583#true} assume true; {583#true} is VALID [2018-11-23 10:02:21,662 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {583#true} {583#true} #69#return; {583#true} is VALID [2018-11-23 10:02:21,662 INFO L256 TraceCheckUtils]: 4: Hoare triple {583#true} call #t~ret7 := main(); {583#true} is VALID [2018-11-23 10:02:21,664 INFO L273 TraceCheckUtils]: 5: Hoare triple {583#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~num~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32; {603#(and (= (_ bv0 32) |main_~#array~0.offset|) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:02:21,665 INFO L273 TraceCheckUtils]: 6: Hoare triple {603#(and (= (_ bv0 32) |main_~#array~0.offset|) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~num~0);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {607#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) |main_#t~mem2|) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-23 10:02:21,666 INFO L273 TraceCheckUtils]: 7: Hoare triple {607#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) |main_#t~mem2|) (= (_ bv0 32) |main_~#array~0.offset|))} assume !(0bv32 == ~bvsrem32(#t~mem2, 2bv32));havoc #t~mem2; {611#(and (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-23 10:02:21,667 INFO L273 TraceCheckUtils]: 8: Hoare triple {611#(and (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {611#(and (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-23 10:02:21,668 INFO L273 TraceCheckUtils]: 9: Hoare triple {611#(and (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|))} assume !~bvslt32(~i~0, ~num~0); {611#(and (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-23 10:02:21,669 INFO L273 TraceCheckUtils]: 10: Hoare triple {611#(and (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|))} ~i~0 := 0bv32; {621#(and (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:02:21,672 INFO L273 TraceCheckUtils]: 11: Hoare triple {621#(and (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~num~0);call #t~mem5 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {625#(and (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~i~0))) |main_#t~mem5|) (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:02:21,674 INFO L273 TraceCheckUtils]: 12: Hoare triple {625#(and (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~i~0))) |main_#t~mem5|) (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|) (= main_~i~0 (_ bv0 32)))} assume 0bv32 != ~bvsrem32(#t~mem5, 2bv32);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {629#(not (= (bvsrem |main_#t~mem6| (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:02:21,675 INFO L256 TraceCheckUtils]: 13: Hoare triple {629#(not (= (bvsrem |main_#t~mem6| (_ bv2 32)) (_ bv0 32)))} call printOdd(#t~mem6); {633#(not (= (_ bv0 32) (bvsrem |printOdd_#in~i| (_ bv2 32))))} is VALID [2018-11-23 10:02:21,676 INFO L273 TraceCheckUtils]: 14: Hoare triple {633#(not (= (_ bv0 32) (bvsrem |printOdd_#in~i| (_ bv2 32))))} ~i := #in~i; {637#(not (= (_ bv0 32) (bvsrem printOdd_~i (_ bv2 32))))} is VALID [2018-11-23 10:02:21,678 INFO L256 TraceCheckUtils]: 15: Hoare triple {637#(not (= (_ bv0 32) (bvsrem printOdd_~i (_ bv2 32))))} call __VERIFIER_assert((if 0bv32 != ~bvsrem32(~i, 2bv32) then 1bv32 else 0bv32)); {641#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:21,679 INFO L273 TraceCheckUtils]: 16: Hoare triple {641#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {645#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:21,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {645#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {584#false} is VALID [2018-11-23 10:02:21,681 INFO L273 TraceCheckUtils]: 18: Hoare triple {584#false} assume !false; {584#false} is VALID [2018-11-23 10:02:21,684 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 10:02:21,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:21,830 INFO L273 TraceCheckUtils]: 18: Hoare triple {584#false} assume !false; {584#false} is VALID [2018-11-23 10:02:21,831 INFO L273 TraceCheckUtils]: 17: Hoare triple {655#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {584#false} is VALID [2018-11-23 10:02:21,836 INFO L273 TraceCheckUtils]: 16: Hoare triple {659#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {655#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:02:21,837 INFO L256 TraceCheckUtils]: 15: Hoare triple {637#(not (= (_ bv0 32) (bvsrem printOdd_~i (_ bv2 32))))} call __VERIFIER_assert((if 0bv32 != ~bvsrem32(~i, 2bv32) then 1bv32 else 0bv32)); {659#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:02:21,838 INFO L273 TraceCheckUtils]: 14: Hoare triple {633#(not (= (_ bv0 32) (bvsrem |printOdd_#in~i| (_ bv2 32))))} ~i := #in~i; {637#(not (= (_ bv0 32) (bvsrem printOdd_~i (_ bv2 32))))} is VALID [2018-11-23 10:02:21,839 INFO L256 TraceCheckUtils]: 13: Hoare triple {629#(not (= (bvsrem |main_#t~mem6| (_ bv2 32)) (_ bv0 32)))} call printOdd(#t~mem6); {633#(not (= (_ bv0 32) (bvsrem |printOdd_#in~i| (_ bv2 32))))} is VALID [2018-11-23 10:02:21,840 INFO L273 TraceCheckUtils]: 12: Hoare triple {672#(or (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~i~0))) (_ bv2 32)))) (= (bvsrem |main_#t~mem5| (_ bv2 32)) (_ bv0 32)))} assume 0bv32 != ~bvsrem32(#t~mem5, 2bv32);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {629#(not (= (bvsrem |main_#t~mem6| (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:02:21,840 INFO L273 TraceCheckUtils]: 11: Hoare triple {583#true} assume !!~bvslt32(~i~0, ~num~0);call #t~mem5 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {672#(or (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~i~0))) (_ bv2 32)))) (= (bvsrem |main_#t~mem5| (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:02:21,841 INFO L273 TraceCheckUtils]: 10: Hoare triple {583#true} ~i~0 := 0bv32; {583#true} is VALID [2018-11-23 10:02:21,841 INFO L273 TraceCheckUtils]: 9: Hoare triple {583#true} assume !~bvslt32(~i~0, ~num~0); {583#true} is VALID [2018-11-23 10:02:21,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {583#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {583#true} is VALID [2018-11-23 10:02:21,841 INFO L273 TraceCheckUtils]: 7: Hoare triple {583#true} assume !(0bv32 == ~bvsrem32(#t~mem2, 2bv32));havoc #t~mem2; {583#true} is VALID [2018-11-23 10:02:21,842 INFO L273 TraceCheckUtils]: 6: Hoare triple {583#true} assume !!~bvslt32(~i~0, ~num~0);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {583#true} is VALID [2018-11-23 10:02:21,842 INFO L273 TraceCheckUtils]: 5: Hoare triple {583#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~num~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32; {583#true} is VALID [2018-11-23 10:02:21,842 INFO L256 TraceCheckUtils]: 4: Hoare triple {583#true} call #t~ret7 := main(); {583#true} is VALID [2018-11-23 10:02:21,843 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {583#true} {583#true} #69#return; {583#true} is VALID [2018-11-23 10:02:21,843 INFO L273 TraceCheckUtils]: 2: Hoare triple {583#true} assume true; {583#true} is VALID [2018-11-23 10:02:21,843 INFO L273 TraceCheckUtils]: 1: Hoare triple {583#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {583#true} is VALID [2018-11-23 10:02:21,844 INFO L256 TraceCheckUtils]: 0: Hoare triple {583#true} call ULTIMATE.init(); {583#true} is VALID [2018-11-23 10:02:21,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 10:02:21,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 10:02:21,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 15 [2018-11-23 10:02:21,855 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 19 [2018-11-23 10:02:21,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:21,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 10:02:21,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:21,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 10:02:21,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 10:02:21,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-11-23 10:02:21,910 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 15 states. [2018-11-23 10:02:24,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:24,398 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2018-11-23 10:02:24,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 10:02:24,399 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 19 [2018-11-23 10:02:24,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 10:02:24,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 10:02:24,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 10:02:24,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 10:02:24,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 86 transitions. [2018-11-23 10:02:24,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:24,599 INFO L225 Difference]: With dead ends: 72 [2018-11-23 10:02:24,599 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 10:02:24,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-11-23 10:02:24,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 10:02:24,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 10:02:24,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:24,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 10:02:24,601 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 10:02:24,601 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 10:02:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:24,601 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 10:02:24,602 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:02:24,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:24,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:24,602 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 10:02:24,602 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 10:02:24,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:24,603 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 10:02:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:02:24,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:24,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:24,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:24,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:24,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 10:02:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 10:02:24,604 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-11-23 10:02:24,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:24,604 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 10:02:24,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 10:02:24,604 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:02:24,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:24,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 10:02:25,043 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 10:02:25,043 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 10:02:25,044 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 10:02:25,044 INFO L451 ceAbstractionStarter]: At program point printOddENTRY(lines 7 9) the Hoare annotation is: true [2018-11-23 10:02:25,044 INFO L444 ceAbstractionStarter]: At program point L8(line 8) the Hoare annotation is: (or (not (= (_ bv0 32) (bvsrem printOdd_~i (_ bv2 32)))) (= (_ bv0 32) (bvsrem |printOdd_#in~i| (_ bv2 32)))) [2018-11-23 10:02:25,044 INFO L448 ceAbstractionStarter]: For program point printOddFINAL(lines 7 9) no Hoare annotation was computed. [2018-11-23 10:02:25,044 INFO L448 ceAbstractionStarter]: For program point printOddEXIT(lines 7 9) no Hoare annotation was computed. [2018-11-23 10:02:25,044 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 10:02:25,045 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 10:02:25,045 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 10:02:25,045 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 10:02:25,045 INFO L448 ceAbstractionStarter]: For program point printEvenEXIT(lines 4 6) no Hoare annotation was computed. [2018-11-23 10:02:25,045 INFO L451 ceAbstractionStarter]: At program point printEvenENTRY(lines 4 6) the Hoare annotation is: true [2018-11-23 10:02:25,045 INFO L448 ceAbstractionStarter]: For program point printEvenFINAL(lines 4 6) no Hoare annotation was computed. [2018-11-23 10:02:25,046 INFO L444 ceAbstractionStarter]: At program point L5(line 5) the Hoare annotation is: (or (not (= (_ bv0 32) (bvsrem |printEven_#in~i| (_ bv2 32)))) (= (bvsrem printEven_~i (_ bv2 32)) (_ bv0 32))) [2018-11-23 10:02:25,046 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 30) no Hoare annotation was computed. [2018-11-23 10:02:25,046 INFO L444 ceAbstractionStarter]: At program point L19(line 19) the Hoare annotation is: (= (bvsrem |main_#t~mem3| (_ bv2 32)) (_ bv0 32)) [2018-11-23 10:02:25,046 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2018-11-23 10:02:25,046 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 20) no Hoare annotation was computed. [2018-11-23 10:02:25,046 INFO L448 ceAbstractionStarter]: For program point L15-2(lines 15 21) no Hoare annotation was computed. [2018-11-23 10:02:25,046 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 30) no Hoare annotation was computed. [2018-11-23 10:02:25,046 INFO L451 ceAbstractionStarter]: At program point L15-3(lines 15 21) the Hoare annotation is: true [2018-11-23 10:02:25,047 INFO L448 ceAbstractionStarter]: For program point L15-4(lines 15 21) no Hoare annotation was computed. [2018-11-23 10:02:25,047 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 30) the Hoare annotation is: true [2018-11-23 10:02:25,047 INFO L444 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (and (not (= (bvsrem |main_#t~mem6| (_ bv2 32)) (_ bv0 32))) (or (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~i~0))) (_ bv2 32)))) (= (bvsrem |main_#t~mem5| (_ bv2 32)) (_ bv0 32)))) [2018-11-23 10:02:25,047 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-11-23 10:02:25,047 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 27) no Hoare annotation was computed. [2018-11-23 10:02:25,047 INFO L448 ceAbstractionStarter]: For program point L22-2(lines 22 28) no Hoare annotation was computed. [2018-11-23 10:02:25,047 INFO L451 ceAbstractionStarter]: At program point L22-3(lines 22 28) the Hoare annotation is: true [2018-11-23 10:02:25,047 INFO L448 ceAbstractionStarter]: For program point L22-4(lines 22 28) no Hoare annotation was computed. [2018-11-23 10:02:25,048 INFO L448 ceAbstractionStarter]: For program point L3-3(line 3) no Hoare annotation was computed. [2018-11-23 10:02:25,048 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 3) the Hoare annotation is: true [2018-11-23 10:02:25,048 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 3) no Hoare annotation was computed. [2018-11-23 10:02:25,048 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2018-11-23 10:02:25,048 INFO L448 ceAbstractionStarter]: For program point L3(line 3) no Hoare annotation was computed. [2018-11-23 10:02:25,048 INFO L448 ceAbstractionStarter]: For program point L3-1(line 3) no Hoare annotation was computed. [2018-11-23 10:02:25,050 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 10:02:25,051 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 10:02:25,052 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 10:02:25,052 WARN L170 areAnnotationChecker]: printOddFINAL has no Hoare annotation [2018-11-23 10:02:25,052 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 10:02:25,052 WARN L170 areAnnotationChecker]: printEvenFINAL has no Hoare annotation [2018-11-23 10:02:25,052 WARN L170 areAnnotationChecker]: L15-4 has no Hoare annotation [2018-11-23 10:02:25,052 WARN L170 areAnnotationChecker]: L15-4 has no Hoare annotation [2018-11-23 10:02:25,052 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 10:02:25,052 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 10:02:25,053 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 10:02:25,053 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 10:02:25,053 WARN L170 areAnnotationChecker]: printOddFINAL has no Hoare annotation [2018-11-23 10:02:25,053 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 10:02:25,053 WARN L170 areAnnotationChecker]: printEvenFINAL has no Hoare annotation [2018-11-23 10:02:25,053 WARN L170 areAnnotationChecker]: L15-4 has no Hoare annotation [2018-11-23 10:02:25,053 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 10:02:25,053 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 10:02:25,053 WARN L170 areAnnotationChecker]: L3-1 has no Hoare annotation [2018-11-23 10:02:25,054 WARN L170 areAnnotationChecker]: L3-1 has no Hoare annotation [2018-11-23 10:02:25,054 WARN L170 areAnnotationChecker]: L3-3 has no Hoare annotation [2018-11-23 10:02:25,054 WARN L170 areAnnotationChecker]: printOddEXIT has no Hoare annotation [2018-11-23 10:02:25,054 WARN L170 areAnnotationChecker]: printEvenEXIT has no Hoare annotation [2018-11-23 10:02:25,054 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2018-11-23 10:02:25,054 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2018-11-23 10:02:25,054 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 10:02:25,055 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-23 10:02:25,055 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2018-11-23 10:02:25,055 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 10:02:25,055 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 10:02:25,055 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-23 10:02:25,055 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-23 10:02:25,055 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2018-11-23 10:02:25,055 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 10:02:25,056 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 10:02:25,056 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2018-11-23 10:02:25,056 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:02:25,056 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-23 10:02:25,056 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 10:02:25,057 INFO L163 areAnnotationChecker]: CFG has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 10:02:25,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:02:25 BoogieIcfgContainer [2018-11-23 10:02:25,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 10:02:25,063 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 10:02:25,063 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 10:02:25,063 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 10:02:25,064 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:17" (3/4) ... [2018-11-23 10:02:25,068 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 10:02:25,076 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 10:02:25,077 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure printOdd [2018-11-23 10:02:25,077 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure printEven [2018-11-23 10:02:25,077 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 10:02:25,077 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 10:02:25,083 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-23 10:02:25,083 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-23 10:02:25,083 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 10:02:25,134 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/array-examples/sanfoundry_24_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 10:02:25,134 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 10:02:25,136 INFO L168 Benchmark]: Toolchain (without parser) took 9340.11 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 698.9 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -209.5 MB). Peak memory consumption was 489.4 MB. Max. memory is 7.1 GB. [2018-11-23 10:02:25,138 INFO L168 Benchmark]: CDTParser took 0.25 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 10:02:25,138 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.49 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 10:02:25,139 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.76 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 10:02:25,139 INFO L168 Benchmark]: Boogie Preprocessor took 40.26 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 10:02:25,140 INFO L168 Benchmark]: RCFGBuilder took 764.41 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 698.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -721.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-23 10:02:25,141 INFO L168 Benchmark]: TraceAbstraction took 8014.12 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 501.0 MB). Peak memory consumption was 501.0 MB. Max. memory is 7.1 GB. [2018-11-23 10:02:25,141 INFO L168 Benchmark]: Witness Printer took 71.57 ms. Allocated memory is still 2.2 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 10:02:25,145 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.25 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 409.49 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 33.76 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 40.26 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 764.41 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 698.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -721.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8014.12 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 501.0 MB). Peak memory consumption was 501.0 MB. Max. memory is 7.1 GB. * Witness Printer took 71.57 ms. Allocated memory is still 2.2 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 15]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. SAFE Result, 7.9s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 92 SDtfs, 43 SDslu, 512 SDs, 0 SdLazy, 298 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 34 PreInvPairs, 47 NumberOfFragments, 65 HoareAnnotationTreeSize, 34 FomulaSimplifications, 101 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 37 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 4510 SizeOfPredicates, 20 NumberOfNonLiveVariables, 128 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...