java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loops/sum04_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:14:53,928 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:14:53,930 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:14:53,949 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:14:53,949 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:14:53,950 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:14:53,952 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:14:53,957 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:14:53,959 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:14:53,968 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:14:53,969 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:14:53,969 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:14:53,970 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:14:53,971 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:14:53,975 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:14:53,976 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:14:53,980 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:14:53,983 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:14:53,988 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:14:53,993 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:14:53,994 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:14:53,996 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:14:53,998 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:14:53,998 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:14:53,998 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:14:53,999 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:14:54,000 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:14:54,001 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:14:54,001 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:14:54,003 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:14:54,003 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:14:54,003 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:14:54,004 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:14:54,004 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:14:54,005 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:14:54,005 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:14:54,006 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-18 22:14:54,021 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:14:54,021 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:14:54,022 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:14:54,022 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:14:54,023 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:14:54,023 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:14:54,023 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:14:54,023 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:14:54,024 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:14:54,024 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:14:54,024 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:14:54,024 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:14:54,024 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:14:54,025 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:14:54,025 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:14:54,025 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:14:54,025 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:14:54,025 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:14:54,025 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:14:54,026 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:14:54,026 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:14:54,026 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:14:54,026 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:14:54,026 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:14:54,027 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:14:54,027 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:14:54,027 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:14:54,027 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:14:54,027 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:14:54,028 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:14:54,028 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:14:54,028 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:14:54,028 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:14:54,074 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:14:54,091 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:14:54,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:14:54,096 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:14:54,097 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:14:54,098 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04_false-unreach-call_true-termination.i [2018-11-18 22:14:54,162 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9df3ab38/10debd0ff46b4480beb25c8dd743da41/FLAG32d27f64e [2018-11-18 22:14:54,582 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:14:54,583 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04_false-unreach-call_true-termination.i [2018-11-18 22:14:54,589 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9df3ab38/10debd0ff46b4480beb25c8dd743da41/FLAG32d27f64e [2018-11-18 22:14:54,970 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9df3ab38/10debd0ff46b4480beb25c8dd743da41 [2018-11-18 22:14:54,980 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:14:54,982 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:14:54,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:14:54,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:14:54,990 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:14:54,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:14:54" (1/1) ... [2018-11-18 22:14:54,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77fc2773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:14:54, skipping insertion in model container [2018-11-18 22:14:54,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:14:54" (1/1) ... [2018-11-18 22:14:55,007 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:14:55,032 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:14:55,302 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:14:55,310 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:14:55,329 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:14:55,347 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:14:55,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:14:55 WrapperNode [2018-11-18 22:14:55,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:14:55,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:14:55,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:14:55,349 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:14:55,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:14:55" (1/1) ... [2018-11-18 22:14:55,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:14:55" (1/1) ... [2018-11-18 22:14:55,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:14:55" (1/1) ... [2018-11-18 22:14:55,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:14:55" (1/1) ... [2018-11-18 22:14:55,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:14:55" (1/1) ... [2018-11-18 22:14:55,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:14:55" (1/1) ... [2018-11-18 22:14:55,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:14:55" (1/1) ... [2018-11-18 22:14:55,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:14:55,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:14:55,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:14:55,386 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:14:55,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:14:55" (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-18 22:14:55,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:14:55,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:14:55,511 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:14:55,512 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:14:55,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:14:55,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:14:55,512 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:14:55,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:14:55,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:14:55,971 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:14:55,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:14:55 BoogieIcfgContainer [2018-11-18 22:14:55,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:14:55,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:14:55,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:14:55,976 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:14:55,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:14:54" (1/3) ... [2018-11-18 22:14:55,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccda315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:14:55, skipping insertion in model container [2018-11-18 22:14:55,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:14:55" (2/3) ... [2018-11-18 22:14:55,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccda315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:14:55, skipping insertion in model container [2018-11-18 22:14:55,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:14:55" (3/3) ... [2018-11-18 22:14:55,979 INFO L112 eAbstractionObserver]: Analyzing ICFG sum04_false-unreach-call_true-termination.i [2018-11-18 22:14:55,987 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:14:55,995 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:14:56,009 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:14:56,043 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:14:56,044 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:14:56,044 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:14:56,044 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:14:56,045 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:14:56,046 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:14:56,046 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:14:56,046 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:14:56,046 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:14:56,066 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-18 22:14:56,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 22:14:56,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:14:56,073 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:14:56,076 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:14:56,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:14:56,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1713253442, now seen corresponding path program 1 times [2018-11-18 22:14:56,086 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:14:56,086 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-18 22:14:56,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:14:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:14:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:14:56,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:14:56,222 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-18 22:14:56,226 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-18 22:14:56,226 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #38#return; {23#true} is VALID [2018-11-18 22:14:56,227 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret1 := main(); {23#true} is VALID [2018-11-18 22:14:56,228 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {23#true} is VALID [2018-11-18 22:14:56,231 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} assume !true; {24#false} is VALID [2018-11-18 22:14:56,231 INFO L256 TraceCheckUtils]: 6: Hoare triple {24#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {24#false} is VALID [2018-11-18 22:14:56,232 INFO L273 TraceCheckUtils]: 7: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2018-11-18 22:14:56,232 INFO L273 TraceCheckUtils]: 8: Hoare triple {24#false} assume 0bv32 == ~cond; {24#false} is VALID [2018-11-18 22:14:56,232 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-18 22:14:56,235 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-18 22:14:56,235 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:14:56,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:14:56,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:14:56,244 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-18 22:14:56,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:14:56,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:14:56,282 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-18 22:14:56,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:14:56,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:14:56,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:14:56,293 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-18 22:14:56,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:14:56,412 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-18 22:14:56,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:14:56,413 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-18 22:14:56,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:14:56,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:14:56,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-18 22:14:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:14:56,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-18 22:14:56,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 35 transitions. [2018-11-18 22:14:56,765 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:14:56,776 INFO L225 Difference]: With dead ends: 31 [2018-11-18 22:14:56,776 INFO L226 Difference]: Without dead ends: 14 [2018-11-18 22:14:56,779 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:14:56,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-18 22:14:56,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-18 22:14:56,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:14:56,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-18 22:14:56,842 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-18 22:14:56,842 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-18 22:14:56,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:14:56,845 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-18 22:14:56,845 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-18 22:14:56,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:14:56,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:14:56,846 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-18 22:14:56,846 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-18 22:14:56,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:14:56,849 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-18 22:14:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-18 22:14:56,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:14:56,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:14:56,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:14:56,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:14:56,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:14:56,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-18 22:14:56,854 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-18 22:14:56,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:14:56,855 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-18 22:14:56,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:14:56,855 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-18 22:14:56,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 22:14:56,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:14:56,856 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:14:56,856 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:14:56,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:14:56,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1143179357, now seen corresponding path program 1 times [2018-11-18 22:14:56,857 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:14:56,857 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-18 22:14:56,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:14:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:14:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:14:56,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:14:57,046 INFO L256 TraceCheckUtils]: 0: Hoare triple {143#true} call ULTIMATE.init(); {143#true} is VALID [2018-11-18 22:14:57,047 INFO L273 TraceCheckUtils]: 1: Hoare triple {143#true} assume true; {143#true} is VALID [2018-11-18 22:14:57,047 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {143#true} {143#true} #38#return; {143#true} is VALID [2018-11-18 22:14:57,047 INFO L256 TraceCheckUtils]: 3: Hoare triple {143#true} call #t~ret1 := main(); {143#true} is VALID [2018-11-18 22:14:57,050 INFO L273 TraceCheckUtils]: 4: Hoare triple {143#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {160#(= (_ bv0 32) main_~sn~0)} is VALID [2018-11-18 22:14:57,050 INFO L273 TraceCheckUtils]: 5: Hoare triple {160#(= (_ bv0 32) main_~sn~0)} assume true; {160#(= (_ bv0 32) main_~sn~0)} is VALID [2018-11-18 22:14:57,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {160#(= (_ bv0 32) main_~sn~0)} assume !~bvsle32(~i~0, 8bv32); {160#(= (_ bv0 32) main_~sn~0)} is VALID [2018-11-18 22:14:57,053 INFO L256 TraceCheckUtils]: 7: Hoare triple {160#(= (_ bv0 32) main_~sn~0)} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {170#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:14:57,062 INFO L273 TraceCheckUtils]: 8: Hoare triple {170#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {174#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:14:57,070 INFO L273 TraceCheckUtils]: 9: Hoare triple {174#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {144#false} is VALID [2018-11-18 22:14:57,070 INFO L273 TraceCheckUtils]: 10: Hoare triple {144#false} assume !false; {144#false} is VALID [2018-11-18 22:14:57,072 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-18 22:14:57,072 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:14:57,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:14:57,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 22:14:57,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-18 22:14:57,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:14:57,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:14:57,108 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-18 22:14:57,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:14:57,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:14:57,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:14:57,109 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-11-18 22:14:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:14:57,396 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-18 22:14:57,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:14:57,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-18 22:14:57,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:14:57,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:14:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-18 22:14:57,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:14:57,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-18 22:14:57,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2018-11-18 22:14:57,458 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:14:57,461 INFO L225 Difference]: With dead ends: 23 [2018-11-18 22:14:57,461 INFO L226 Difference]: Without dead ends: 18 [2018-11-18 22:14:57,462 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-18 22:14:57,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-18 22:14:57,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-18 22:14:57,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:14:57,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-18 22:14:57,531 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-18 22:14:57,531 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-18 22:14:57,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:14:57,534 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-18 22:14:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-18 22:14:57,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:14:57,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:14:57,535 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-18 22:14:57,535 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-18 22:14:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:14:57,537 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-18 22:14:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-18 22:14:57,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:14:57,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:14:57,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:14:57,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:14:57,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:14:57,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-18 22:14:57,541 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2018-11-18 22:14:57,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:14:57,541 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-18 22:14:57,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:14:57,542 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-18 22:14:57,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 22:14:57,542 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:14:57,543 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:14:57,543 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:14:57,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:14:57,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1652058138, now seen corresponding path program 1 times [2018-11-18 22:14:57,544 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:14:57,544 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-18 22:14:57,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:14:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:14:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:14:57,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:14:57,972 INFO L256 TraceCheckUtils]: 0: Hoare triple {277#true} call ULTIMATE.init(); {277#true} is VALID [2018-11-18 22:14:57,973 INFO L273 TraceCheckUtils]: 1: Hoare triple {277#true} assume true; {277#true} is VALID [2018-11-18 22:14:57,973 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {277#true} {277#true} #38#return; {277#true} is VALID [2018-11-18 22:14:57,973 INFO L256 TraceCheckUtils]: 3: Hoare triple {277#true} call #t~ret1 := main(); {277#true} is VALID [2018-11-18 22:14:57,978 INFO L273 TraceCheckUtils]: 4: Hoare triple {277#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {294#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:14:57,979 INFO L273 TraceCheckUtils]: 5: Hoare triple {294#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {294#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:14:57,980 INFO L273 TraceCheckUtils]: 6: Hoare triple {294#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32); {294#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:14:57,982 INFO L273 TraceCheckUtils]: 7: Hoare triple {294#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {294#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:14:57,983 INFO L273 TraceCheckUtils]: 8: Hoare triple {294#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {307#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 22:14:57,984 INFO L273 TraceCheckUtils]: 9: Hoare triple {307#(= (_ bv2 32) main_~i~0)} assume true; {307#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 22:14:57,985 INFO L273 TraceCheckUtils]: 10: Hoare triple {307#(= (_ bv2 32) main_~i~0)} assume !~bvsle32(~i~0, 8bv32); {278#false} is VALID [2018-11-18 22:14:57,985 INFO L256 TraceCheckUtils]: 11: Hoare triple {278#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {278#false} is VALID [2018-11-18 22:14:57,985 INFO L273 TraceCheckUtils]: 12: Hoare triple {278#false} ~cond := #in~cond; {278#false} is VALID [2018-11-18 22:14:57,986 INFO L273 TraceCheckUtils]: 13: Hoare triple {278#false} assume 0bv32 == ~cond; {278#false} is VALID [2018-11-18 22:14:57,986 INFO L273 TraceCheckUtils]: 14: Hoare triple {278#false} assume !false; {278#false} is VALID [2018-11-18 22:14:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:14:57,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:14:58,183 INFO L273 TraceCheckUtils]: 14: Hoare triple {278#false} assume !false; {278#false} is VALID [2018-11-18 22:14:58,184 INFO L273 TraceCheckUtils]: 13: Hoare triple {278#false} assume 0bv32 == ~cond; {278#false} is VALID [2018-11-18 22:14:58,184 INFO L273 TraceCheckUtils]: 12: Hoare triple {278#false} ~cond := #in~cond; {278#false} is VALID [2018-11-18 22:14:58,184 INFO L256 TraceCheckUtils]: 11: Hoare triple {278#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {278#false} is VALID [2018-11-18 22:14:58,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {338#(bvsle main_~i~0 (_ bv8 32))} assume !~bvsle32(~i~0, 8bv32); {278#false} is VALID [2018-11-18 22:14:58,186 INFO L273 TraceCheckUtils]: 9: Hoare triple {338#(bvsle main_~i~0 (_ bv8 32))} assume true; {338#(bvsle main_~i~0 (_ bv8 32))} is VALID [2018-11-18 22:14:58,203 INFO L273 TraceCheckUtils]: 8: Hoare triple {345#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {338#(bvsle main_~i~0 (_ bv8 32))} is VALID [2018-11-18 22:14:58,210 INFO L273 TraceCheckUtils]: 7: Hoare triple {345#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {345#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-18 22:14:58,211 INFO L273 TraceCheckUtils]: 6: Hoare triple {345#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} assume !!~bvsle32(~i~0, 8bv32); {345#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-18 22:14:58,212 INFO L273 TraceCheckUtils]: 5: Hoare triple {345#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} assume true; {345#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-18 22:14:58,214 INFO L273 TraceCheckUtils]: 4: Hoare triple {277#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {345#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-18 22:14:58,214 INFO L256 TraceCheckUtils]: 3: Hoare triple {277#true} call #t~ret1 := main(); {277#true} is VALID [2018-11-18 22:14:58,214 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {277#true} {277#true} #38#return; {277#true} is VALID [2018-11-18 22:14:58,215 INFO L273 TraceCheckUtils]: 1: Hoare triple {277#true} assume true; {277#true} is VALID [2018-11-18 22:14:58,215 INFO L256 TraceCheckUtils]: 0: Hoare triple {277#true} call ULTIMATE.init(); {277#true} is VALID [2018-11-18 22:14:58,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:14:58,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:14:58,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-18 22:14:58,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-18 22:14:58,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:14:58,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:14:58,252 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-18 22:14:58,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:14:58,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:14:58,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:14:58,254 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 6 states. [2018-11-18 22:14:58,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:14:58,547 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2018-11-18 22:14:58,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:14:58,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-18 22:14:58,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:14:58,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:14:58,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-11-18 22:14:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:14:58,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-11-18 22:14:58,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2018-11-18 22:14:58,635 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:14:58,636 INFO L225 Difference]: With dead ends: 41 [2018-11-18 22:14:58,637 INFO L226 Difference]: Without dead ends: 28 [2018-11-18 22:14:58,638 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:14:58,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-18 22:14:58,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-18 22:14:58,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:14:58,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-18 22:14:58,670 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-18 22:14:58,670 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-18 22:14:58,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:14:58,674 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-18 22:14:58,674 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-18 22:14:58,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:14:58,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:14:58,678 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-18 22:14:58,678 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-18 22:14:58,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:14:58,680 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-18 22:14:58,681 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-18 22:14:58,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:14:58,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:14:58,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:14:58,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:14:58,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:14:58,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-18 22:14:58,685 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 15 [2018-11-18 22:14:58,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:14:58,686 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-18 22:14:58,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:14:58,686 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-18 22:14:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 22:14:58,687 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:14:58,687 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:14:58,688 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:14:58,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:14:58,688 INFO L82 PathProgramCache]: Analyzing trace with hash 352425279, now seen corresponding path program 1 times [2018-11-18 22:14:58,689 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:14:58,689 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:14:58,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:14:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:14:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:14:58,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:14:58,986 INFO L256 TraceCheckUtils]: 0: Hoare triple {525#true} call ULTIMATE.init(); {525#true} is VALID [2018-11-18 22:14:58,986 INFO L273 TraceCheckUtils]: 1: Hoare triple {525#true} assume true; {525#true} is VALID [2018-11-18 22:14:58,987 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {525#true} {525#true} #38#return; {525#true} is VALID [2018-11-18 22:14:58,987 INFO L256 TraceCheckUtils]: 3: Hoare triple {525#true} call #t~ret1 := main(); {525#true} is VALID [2018-11-18 22:14:58,988 INFO L273 TraceCheckUtils]: 4: Hoare triple {525#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {542#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:14:58,989 INFO L273 TraceCheckUtils]: 5: Hoare triple {542#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {542#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:14:58,989 INFO L273 TraceCheckUtils]: 6: Hoare triple {542#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32); {542#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:14:58,990 INFO L273 TraceCheckUtils]: 7: Hoare triple {542#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {542#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:14:58,991 INFO L273 TraceCheckUtils]: 8: Hoare triple {542#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {555#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 22:14:58,991 INFO L273 TraceCheckUtils]: 9: Hoare triple {555#(= (_ bv2 32) main_~i~0)} assume true; {555#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 22:14:58,992 INFO L273 TraceCheckUtils]: 10: Hoare triple {555#(= (_ bv2 32) main_~i~0)} assume !!~bvsle32(~i~0, 8bv32); {555#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 22:14:58,995 INFO L273 TraceCheckUtils]: 11: Hoare triple {555#(= (_ bv2 32) main_~i~0)} assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {555#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 22:14:59,000 INFO L273 TraceCheckUtils]: 12: Hoare triple {555#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {568#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 22:14:59,001 INFO L273 TraceCheckUtils]: 13: Hoare triple {568#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {568#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 22:14:59,001 INFO L273 TraceCheckUtils]: 14: Hoare triple {568#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32); {568#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 22:14:59,002 INFO L273 TraceCheckUtils]: 15: Hoare triple {568#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {568#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 22:14:59,002 INFO L273 TraceCheckUtils]: 16: Hoare triple {568#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {581#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 22:14:59,006 INFO L273 TraceCheckUtils]: 17: Hoare triple {581#(= (_ bv4 32) main_~i~0)} assume true; {581#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 22:14:59,006 INFO L273 TraceCheckUtils]: 18: Hoare triple {581#(= (_ bv4 32) main_~i~0)} assume !!~bvsle32(~i~0, 8bv32); {581#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 22:14:59,007 INFO L273 TraceCheckUtils]: 19: Hoare triple {581#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 4bv32); {581#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 22:14:59,008 INFO L273 TraceCheckUtils]: 20: Hoare triple {581#(= (_ bv4 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {594#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:14:59,008 INFO L273 TraceCheckUtils]: 21: Hoare triple {594#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {594#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:14:59,009 INFO L273 TraceCheckUtils]: 22: Hoare triple {594#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !~bvsle32(~i~0, 8bv32); {526#false} is VALID [2018-11-18 22:14:59,009 INFO L256 TraceCheckUtils]: 23: Hoare triple {526#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {526#false} is VALID [2018-11-18 22:14:59,009 INFO L273 TraceCheckUtils]: 24: Hoare triple {526#false} ~cond := #in~cond; {526#false} is VALID [2018-11-18 22:14:59,010 INFO L273 TraceCheckUtils]: 25: Hoare triple {526#false} assume 0bv32 == ~cond; {526#false} is VALID [2018-11-18 22:14:59,010 INFO L273 TraceCheckUtils]: 26: Hoare triple {526#false} assume !false; {526#false} is VALID [2018-11-18 22:14:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:14:59,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:14:59,393 INFO L273 TraceCheckUtils]: 26: Hoare triple {526#false} assume !false; {526#false} is VALID [2018-11-18 22:14:59,394 INFO L273 TraceCheckUtils]: 25: Hoare triple {526#false} assume 0bv32 == ~cond; {526#false} is VALID [2018-11-18 22:14:59,394 INFO L273 TraceCheckUtils]: 24: Hoare triple {526#false} ~cond := #in~cond; {526#false} is VALID [2018-11-18 22:14:59,394 INFO L256 TraceCheckUtils]: 23: Hoare triple {526#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {526#false} is VALID [2018-11-18 22:14:59,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {625#(bvsle main_~i~0 (_ bv8 32))} assume !~bvsle32(~i~0, 8bv32); {526#false} is VALID [2018-11-18 22:14:59,396 INFO L273 TraceCheckUtils]: 21: Hoare triple {625#(bvsle main_~i~0 (_ bv8 32))} assume true; {625#(bvsle main_~i~0 (_ bv8 32))} is VALID [2018-11-18 22:14:59,397 INFO L273 TraceCheckUtils]: 20: Hoare triple {632#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {625#(bvsle main_~i~0 (_ bv8 32))} is VALID [2018-11-18 22:14:59,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {632#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} assume !~bvslt32(~i~0, 4bv32); {632#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-18 22:14:59,398 INFO L273 TraceCheckUtils]: 18: Hoare triple {632#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} assume !!~bvsle32(~i~0, 8bv32); {632#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-18 22:14:59,398 INFO L273 TraceCheckUtils]: 17: Hoare triple {632#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} assume true; {632#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-18 22:14:59,403 INFO L273 TraceCheckUtils]: 16: Hoare triple {645#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {632#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-18 22:14:59,404 INFO L273 TraceCheckUtils]: 15: Hoare triple {645#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {645#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} is VALID [2018-11-18 22:14:59,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {645#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} assume !!~bvsle32(~i~0, 8bv32); {645#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} is VALID [2018-11-18 22:14:59,405 INFO L273 TraceCheckUtils]: 13: Hoare triple {645#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} assume true; {645#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} is VALID [2018-11-18 22:14:59,408 INFO L273 TraceCheckUtils]: 12: Hoare triple {658#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {645#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} is VALID [2018-11-18 22:14:59,409 INFO L273 TraceCheckUtils]: 11: Hoare triple {658#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {658#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} is VALID [2018-11-18 22:14:59,410 INFO L273 TraceCheckUtils]: 10: Hoare triple {658#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} assume !!~bvsle32(~i~0, 8bv32); {658#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} is VALID [2018-11-18 22:14:59,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {658#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} assume true; {658#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} is VALID [2018-11-18 22:14:59,413 INFO L273 TraceCheckUtils]: 8: Hoare triple {671#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {658#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} is VALID [2018-11-18 22:14:59,414 INFO L273 TraceCheckUtils]: 7: Hoare triple {671#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {671#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} is VALID [2018-11-18 22:14:59,415 INFO L273 TraceCheckUtils]: 6: Hoare triple {671#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} assume !!~bvsle32(~i~0, 8bv32); {671#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} is VALID [2018-11-18 22:14:59,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {671#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} assume true; {671#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} is VALID [2018-11-18 22:14:59,416 INFO L273 TraceCheckUtils]: 4: Hoare triple {525#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {671#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} is VALID [2018-11-18 22:14:59,416 INFO L256 TraceCheckUtils]: 3: Hoare triple {525#true} call #t~ret1 := main(); {525#true} is VALID [2018-11-18 22:14:59,417 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {525#true} {525#true} #38#return; {525#true} is VALID [2018-11-18 22:14:59,417 INFO L273 TraceCheckUtils]: 1: Hoare triple {525#true} assume true; {525#true} is VALID [2018-11-18 22:14:59,417 INFO L256 TraceCheckUtils]: 0: Hoare triple {525#true} call ULTIMATE.init(); {525#true} is VALID [2018-11-18 22:14:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:14:59,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:14:59,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-18 22:14:59,432 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-18 22:14:59,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:14:59,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:14:59,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:14:59,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:14:59,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:14:59,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:14:59,518 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 12 states. [2018-11-18 22:15:00,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:00,264 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2018-11-18 22:15:00,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 22:15:00,265 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-18 22:15:00,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:15:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:15:00,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2018-11-18 22:15:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:15:00,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2018-11-18 22:15:00,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2018-11-18 22:15:00,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:00,490 INFO L225 Difference]: With dead ends: 61 [2018-11-18 22:15:00,490 INFO L226 Difference]: Without dead ends: 49 [2018-11-18 22:15:00,491 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2018-11-18 22:15:00,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-18 22:15:00,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-18 22:15:00,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:15:00,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 48 states. [2018-11-18 22:15:00,521 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 48 states. [2018-11-18 22:15:00,521 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 48 states. [2018-11-18 22:15:00,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:00,524 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-18 22:15:00,525 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-18 22:15:00,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:15:00,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:15:00,526 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 49 states. [2018-11-18 22:15:00,526 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 49 states. [2018-11-18 22:15:00,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:00,529 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-18 22:15:00,529 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-18 22:15:00,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:15:00,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:15:00,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:15:00,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:15:00,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 22:15:00,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-18 22:15:00,534 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 27 [2018-11-18 22:15:00,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:15:00,534 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-18 22:15:00,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:15:00,534 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-18 22:15:00,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 22:15:00,536 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:15:00,536 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:15:00,537 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:15:00,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:15:00,537 INFO L82 PathProgramCache]: Analyzing trace with hash 940069211, now seen corresponding path program 2 times [2018-11-18 22:15:00,538 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:15:00,538 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 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 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:15:00,556 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 22:15:00,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:15:00,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-18 22:15:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 22:15:00,693 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 22:15:00,740 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 22:15:00,740 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-18 22:15:00,740 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-18 22:15:00,740 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-18 22:15:00,740 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-18 22:15:00,740 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 22:15:00,741 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-18 22:15:00,741 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-18 22:15:00,741 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-18 22:15:00,741 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-18 22:15:00,741 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 22:15:00,741 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 22:15:00,741 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 22:15:00,742 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-18 22:15:00,742 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-18 22:15:00,742 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2018-11-18 22:15:00,742 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2018-11-18 22:15:00,742 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 22:15:00,742 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 22:15:00,742 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-18 22:15:00,743 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-18 22:15:00,743 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-18 22:15:00,743 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 22:15:00,743 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-18 22:15:00,743 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-18 22:15:00,743 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 22:15:00,744 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-18 22:15:00,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:15:00 BoogieIcfgContainer [2018-11-18 22:15:00,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 22:15:00,748 INFO L168 Benchmark]: Toolchain (without parser) took 5767.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -484.3 MB). Peak memory consumption was 249.7 MB. Max. memory is 7.1 GB. [2018-11-18 22:15:00,750 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 22:15:00,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.30 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-18 22:15:00,752 INFO L168 Benchmark]: Boogie Preprocessor took 36.72 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-18 22:15:00,752 INFO L168 Benchmark]: RCFGBuilder took 586.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-18 22:15:00,753 INFO L168 Benchmark]: TraceAbstraction took 4773.49 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 289.7 MB). Peak memory consumption was 289.7 MB. Max. memory is 7.1 GB. [2018-11-18 22:15:00,757 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 364.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.72 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 586.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4773.49 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 289.7 MB). Peak memory consumption was 289.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, sn=0; [L13] i=1 VAL [i=1, sn=0] [L13] COND TRUE i<=8 VAL [i=1, sn=0] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=1, sn=2] [L13] i++ VAL [i=2, sn=2] [L13] COND TRUE i<=8 VAL [i=2, sn=2] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=2, sn=4] [L13] i++ VAL [i=3, sn=4] [L13] COND TRUE i<=8 VAL [i=3, sn=4] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=3, sn=6] [L13] i++ VAL [i=4, sn=6] [L13] COND TRUE i<=8 VAL [i=4, sn=6] [L14] COND FALSE !(i<4) VAL [i=4, sn=6] [L13] i++ VAL [i=5, sn=6] [L13] COND TRUE i<=8 VAL [i=5, sn=6] [L14] COND FALSE !(i<4) VAL [i=5, sn=6] [L13] i++ VAL [i=6, sn=6] [L13] COND TRUE i<=8 VAL [i=6, sn=6] [L14] COND FALSE !(i<4) VAL [i=6, sn=6] [L13] i++ VAL [i=7, sn=6] [L13] COND TRUE i<=8 VAL [i=7, sn=6] [L14] COND FALSE !(i<4) VAL [i=7, sn=6] [L13] i++ VAL [i=8, sn=6] [L13] COND TRUE i<=8 VAL [i=8, sn=6] [L14] COND FALSE !(i<4) VAL [i=8, sn=6] [L13] i++ VAL [i=9, sn=6] [L13] COND FALSE !(i<=8) VAL [i=9, sn=6] [L17] CALL __VERIFIER_assert(sn==8*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 4.7s OverallTime, 5 OverallIterations, 9 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 48 SDslu, 123 SDs, 0 SdLazy, 128 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=4, 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, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 5849 SizeOfPredicates, 4 NumberOfNonLiveVariables, 103 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 0/68 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...