/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/gsv2008.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:51:59,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:51:59,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:51:59,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:51:59,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:51:59,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:51:59,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:51:59,572 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:51:59,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:51:59,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:51:59,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:51:59,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:51:59,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:51:59,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:51:59,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:51:59,601 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:51:59,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:51:59,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:51:59,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:51:59,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:51:59,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:51:59,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:51:59,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:51:59,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:51:59,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:51:59,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:51:59,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:51:59,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:51:59,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:51:59,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:51:59,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:51:59,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:51:59,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:51:59,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:51:59,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:51:59,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:51:59,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:51:59,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:51:59,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:51:59,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:51:59,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:51:59,651 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:51:59,693 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:51:59,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:51:59,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:51:59,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:51:59,695 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:51:59,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:51:59,695 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:51:59,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:51:59,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:51:59,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:51:59,696 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:51:59,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:51:59,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:51:59,697 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:51:59,697 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:51:59,697 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:51:59,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:51:59,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:51:59,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:51:59,700 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:51:59,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:51:59,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:51:59,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:51:59,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:51:59,702 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:51:59,702 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:51:59,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:51:59,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:51:59,703 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:51:59,703 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:52:00,070 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:52:00,084 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:52:00,088 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:52:00,090 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:52:00,090 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:52:00,091 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008.i [2020-07-17 22:52:00,169 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20d1517c9/04470e7b376742eeb521d6499fe7ba0e/FLAG74ca207af [2020-07-17 22:52:00,704 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:52:00,705 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.i [2020-07-17 22:52:00,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20d1517c9/04470e7b376742eeb521d6499fe7ba0e/FLAG74ca207af [2020-07-17 22:52:01,017 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20d1517c9/04470e7b376742eeb521d6499fe7ba0e [2020-07-17 22:52:01,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:52:01,029 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:52:01,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:52:01,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:52:01,036 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:52:01,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:52:01" (1/1) ... [2020-07-17 22:52:01,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a608218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:01, skipping insertion in model container [2020-07-17 22:52:01,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:52:01" (1/1) ... [2020-07-17 22:52:01,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:52:01,072 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:52:01,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:52:01,259 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:52:01,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:52:01,287 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:52:01,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:01 WrapperNode [2020-07-17 22:52:01,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:52:01,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:52:01,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:52:01,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:52:01,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:01" (1/1) ... [2020-07-17 22:52:01,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:01" (1/1) ... [2020-07-17 22:52:01,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:01" (1/1) ... [2020-07-17 22:52:01,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:01" (1/1) ... [2020-07-17 22:52:01,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:01" (1/1) ... [2020-07-17 22:52:01,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:01" (1/1) ... [2020-07-17 22:52:01,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:01" (1/1) ... [2020-07-17 22:52:01,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:52:01,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:52:01,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:52:01,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:52:01,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:01" (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 [2020-07-17 22:52:01,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:52:01,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:52:01,472 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:52:01,472 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:52:01,472 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:52:01,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:52:01,472 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:52:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:52:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:52:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:52:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:52:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:52:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:52:01,743 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:52:01,743 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:52:01,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:52:01 BoogieIcfgContainer [2020-07-17 22:52:01,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:52:01,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:52:01,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:52:01,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:52:01,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:52:01" (1/3) ... [2020-07-17 22:52:01,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b55eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:52:01, skipping insertion in model container [2020-07-17 22:52:01,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:01" (2/3) ... [2020-07-17 22:52:01,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b55eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:52:01, skipping insertion in model container [2020-07-17 22:52:01,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:52:01" (3/3) ... [2020-07-17 22:52:01,757 INFO L109 eAbstractionObserver]: Analyzing ICFG gsv2008.i [2020-07-17 22:52:01,774 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:52:01,782 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:52:01,801 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:52:01,828 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:52:01,828 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:52:01,828 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:52:01,829 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:52:01,829 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:52:01,829 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:52:01,829 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:52:01,830 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:52:01,855 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-17 22:52:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-17 22:52:01,862 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:01,864 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:01,864 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:01,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:01,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1608903343, now seen corresponding path program 1 times [2020-07-17 22:52:01,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:01,886 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620452146] [2020-07-17 22:52:01,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:02,091 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-17 22:52:02,091 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {22#true} {22#true} #44#return; {22#true} is VALID [2020-07-17 22:52:02,094 INFO L263 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2020-07-17 22:52:02,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-17 22:52:02,095 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #44#return; {22#true} is VALID [2020-07-17 22:52:02,095 INFO L263 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2020-07-17 22:52:02,097 INFO L280 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~y~0 := #t~nondet0;havoc #t~nondet0; {26#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-17 22:52:02,099 INFO L280 TraceCheckUtils]: 5: Hoare triple {26#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {26#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-17 22:52:02,100 INFO L280 TraceCheckUtils]: 6: Hoare triple {26#(<= (+ main_~x~0 50) 0)} assume !(~x~0 < 0); {23#false} is VALID [2020-07-17 22:52:02,101 INFO L263 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {23#false} is VALID [2020-07-17 22:52:02,101 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2020-07-17 22:52:02,102 INFO L280 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2020-07-17 22:52:02,102 INFO L280 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-17 22:52:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:02,104 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620452146] [2020-07-17 22:52:02,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:52:02,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:52:02,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801703234] [2020-07-17 22:52:02,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-17 22:52:02,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:02,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:52:02,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:02,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:52:02,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:02,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:52:02,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:52:02,174 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2020-07-17 22:52:02,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:02,295 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2020-07-17 22:52:02,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:52:02,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-17 22:52:02,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:52:02,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2020-07-17 22:52:02,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:52:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2020-07-17 22:52:02,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2020-07-17 22:52:02,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:02,539 INFO L225 Difference]: With dead ends: 34 [2020-07-17 22:52:02,539 INFO L226 Difference]: Without dead ends: 13 [2020-07-17 22:52:02,551 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:52:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-17 22:52:02,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-17 22:52:02,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:02,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2020-07-17 22:52:02,612 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-17 22:52:02,612 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-17 22:52:02,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:02,617 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-07-17 22:52:02,618 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-17 22:52:02,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:02,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:02,619 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-17 22:52:02,619 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-17 22:52:02,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:02,624 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-07-17 22:52:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-17 22:52:02,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:02,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:02,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:02,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:52:02,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2020-07-17 22:52:02,630 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2020-07-17 22:52:02,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:02,631 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2020-07-17 22:52:02,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:52:02,632 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-17 22:52:02,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-17 22:52:02,633 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:02,633 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:02,634 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:52:02,634 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:02,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:02,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1628066164, now seen corresponding path program 1 times [2020-07-17 22:52:02,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:02,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401398313] [2020-07-17 22:52:02,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:02,831 INFO L280 TraceCheckUtils]: 0: Hoare triple {120#true} assume true; {120#true} is VALID [2020-07-17 22:52:02,831 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {120#true} {120#true} #44#return; {120#true} is VALID [2020-07-17 22:52:02,831 INFO L263 TraceCheckUtils]: 0: Hoare triple {120#true} call ULTIMATE.init(); {120#true} is VALID [2020-07-17 22:52:02,832 INFO L280 TraceCheckUtils]: 1: Hoare triple {120#true} assume true; {120#true} is VALID [2020-07-17 22:52:02,832 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {120#true} {120#true} #44#return; {120#true} is VALID [2020-07-17 22:52:02,832 INFO L263 TraceCheckUtils]: 3: Hoare triple {120#true} call #t~ret2 := main(); {120#true} is VALID [2020-07-17 22:52:02,834 INFO L280 TraceCheckUtils]: 4: Hoare triple {120#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~y~0 := #t~nondet0;havoc #t~nondet0; {124#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-17 22:52:02,835 INFO L280 TraceCheckUtils]: 5: Hoare triple {124#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {124#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-17 22:52:02,836 INFO L280 TraceCheckUtils]: 6: Hoare triple {124#(<= (+ main_~x~0 50) 0)} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post1 := ~y~0;~y~0 := 1 + #t~post1;havoc #t~post1; {125#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-17 22:52:02,837 INFO L280 TraceCheckUtils]: 7: Hoare triple {125#(<= (+ main_~x~0 51) main_~y~0)} assume !(~x~0 < 0); {126#(<= 51 main_~y~0)} is VALID [2020-07-17 22:52:02,840 INFO L263 TraceCheckUtils]: 8: Hoare triple {126#(<= 51 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {127#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:52:02,842 INFO L280 TraceCheckUtils]: 9: Hoare triple {127#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {128#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:52:02,843 INFO L280 TraceCheckUtils]: 10: Hoare triple {128#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {121#false} is VALID [2020-07-17 22:52:02,844 INFO L280 TraceCheckUtils]: 11: Hoare triple {121#false} assume !false; {121#false} is VALID [2020-07-17 22:52:02,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:02,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401398313] [2020-07-17 22:52:02,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596893625] [2020-07-17 22:52:02,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:02,882 INFO L264 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:52:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:02,897 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:03,016 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:52:03,125 INFO L263 TraceCheckUtils]: 0: Hoare triple {120#true} call ULTIMATE.init(); {120#true} is VALID [2020-07-17 22:52:03,125 INFO L280 TraceCheckUtils]: 1: Hoare triple {120#true} assume true; {120#true} is VALID [2020-07-17 22:52:03,126 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {120#true} {120#true} #44#return; {120#true} is VALID [2020-07-17 22:52:03,126 INFO L263 TraceCheckUtils]: 3: Hoare triple {120#true} call #t~ret2 := main(); {120#true} is VALID [2020-07-17 22:52:03,127 INFO L280 TraceCheckUtils]: 4: Hoare triple {120#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~y~0 := #t~nondet0;havoc #t~nondet0; {124#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-17 22:52:03,128 INFO L280 TraceCheckUtils]: 5: Hoare triple {124#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {124#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-17 22:52:03,129 INFO L280 TraceCheckUtils]: 6: Hoare triple {124#(<= (+ main_~x~0 50) 0)} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post1 := ~y~0;~y~0 := 1 + #t~post1;havoc #t~post1; {125#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-17 22:52:03,130 INFO L280 TraceCheckUtils]: 7: Hoare triple {125#(<= (+ main_~x~0 51) main_~y~0)} assume !(~x~0 < 0); {126#(<= 51 main_~y~0)} is VALID [2020-07-17 22:52:03,131 INFO L263 TraceCheckUtils]: 8: Hoare triple {126#(<= 51 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {156#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:52:03,132 INFO L280 TraceCheckUtils]: 9: Hoare triple {156#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {160#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:03,133 INFO L280 TraceCheckUtils]: 10: Hoare triple {160#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {121#false} is VALID [2020-07-17 22:52:03,134 INFO L280 TraceCheckUtils]: 11: Hoare triple {121#false} assume !false; {121#false} is VALID [2020-07-17 22:52:03,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:03,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:52:03,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-17 22:52:03,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136754949] [2020-07-17 22:52:03,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2020-07-17 22:52:03,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:03,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:52:03,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:03,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:52:03,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:03,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:52:03,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:52:03,168 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 9 states. [2020-07-17 22:52:03,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:03,377 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-07-17 22:52:03,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:52:03,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2020-07-17 22:52:03,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:52:03,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2020-07-17 22:52:03,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:52:03,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2020-07-17 22:52:03,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 19 transitions. [2020-07-17 22:52:03,427 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:03,429 INFO L225 Difference]: With dead ends: 19 [2020-07-17 22:52:03,429 INFO L226 Difference]: Without dead ends: 14 [2020-07-17 22:52:03,431 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:52:03,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-17 22:52:03,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-17 22:52:03,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:03,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-17 22:52:03,444 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-17 22:52:03,444 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-17 22:52:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:03,446 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-17 22:52:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-17 22:52:03,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:03,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:03,447 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-17 22:52:03,447 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-17 22:52:03,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:03,449 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-17 22:52:03,449 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-17 22:52:03,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:03,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:03,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:03,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:52:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2020-07-17 22:52:03,451 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2020-07-17 22:52:03,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:03,452 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2020-07-17 22:52:03,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:52:03,453 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-17 22:52:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:52:03,454 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:03,454 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:03,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:52:03,663 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:03,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:03,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1105094223, now seen corresponding path program 2 times [2020-07-17 22:52:03,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:03,664 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514125143] [2020-07-17 22:52:03,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:03,875 INFO L280 TraceCheckUtils]: 0: Hoare triple {251#true} assume true; {251#true} is VALID [2020-07-17 22:52:03,875 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {251#true} {251#true} #44#return; {251#true} is VALID [2020-07-17 22:52:03,876 INFO L263 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {251#true} is VALID [2020-07-17 22:52:03,876 INFO L280 TraceCheckUtils]: 1: Hoare triple {251#true} assume true; {251#true} is VALID [2020-07-17 22:52:03,876 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {251#true} {251#true} #44#return; {251#true} is VALID [2020-07-17 22:52:03,877 INFO L263 TraceCheckUtils]: 3: Hoare triple {251#true} call #t~ret2 := main(); {251#true} is VALID [2020-07-17 22:52:03,879 INFO L280 TraceCheckUtils]: 4: Hoare triple {251#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~y~0 := #t~nondet0;havoc #t~nondet0; {255#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-17 22:52:03,881 INFO L280 TraceCheckUtils]: 5: Hoare triple {255#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {255#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-17 22:52:03,882 INFO L280 TraceCheckUtils]: 6: Hoare triple {255#(<= (+ main_~x~0 50) 0)} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post1 := ~y~0;~y~0 := 1 + #t~post1;havoc #t~post1; {256#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-17 22:52:03,883 INFO L280 TraceCheckUtils]: 7: Hoare triple {256#(<= (+ main_~x~0 51) main_~y~0)} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post1 := ~y~0;~y~0 := 1 + #t~post1;havoc #t~post1; {257#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-17 22:52:03,884 INFO L280 TraceCheckUtils]: 8: Hoare triple {257#(<= (+ main_~x~0 53) (* 2 main_~y~0))} assume !(~x~0 < 0); {258#(<= 27 main_~y~0)} is VALID [2020-07-17 22:52:03,886 INFO L263 TraceCheckUtils]: 9: Hoare triple {258#(<= 27 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {259#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:52:03,888 INFO L280 TraceCheckUtils]: 10: Hoare triple {259#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {260#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:52:03,889 INFO L280 TraceCheckUtils]: 11: Hoare triple {260#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {252#false} is VALID [2020-07-17 22:52:03,890 INFO L280 TraceCheckUtils]: 12: Hoare triple {252#false} assume !false; {252#false} is VALID [2020-07-17 22:52:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:03,891 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514125143] [2020-07-17 22:52:03,891 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127470269] [2020-07-17 22:52:03,891 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-17 22:52:03,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:52:03,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:52:03,927 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:03,936 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:04,039 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:52:04,097 INFO L263 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {251#true} is VALID [2020-07-17 22:52:04,097 INFO L280 TraceCheckUtils]: 1: Hoare triple {251#true} assume true; {251#true} is VALID [2020-07-17 22:52:04,098 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {251#true} {251#true} #44#return; {251#true} is VALID [2020-07-17 22:52:04,098 INFO L263 TraceCheckUtils]: 3: Hoare triple {251#true} call #t~ret2 := main(); {251#true} is VALID [2020-07-17 22:52:04,099 INFO L280 TraceCheckUtils]: 4: Hoare triple {251#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~y~0 := #t~nondet0;havoc #t~nondet0; {255#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-17 22:52:04,100 INFO L280 TraceCheckUtils]: 5: Hoare triple {255#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {255#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-17 22:52:04,101 INFO L280 TraceCheckUtils]: 6: Hoare triple {255#(<= (+ main_~x~0 50) 0)} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post1 := ~y~0;~y~0 := 1 + #t~post1;havoc #t~post1; {256#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-17 22:52:04,102 INFO L280 TraceCheckUtils]: 7: Hoare triple {256#(<= (+ main_~x~0 51) main_~y~0)} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post1 := ~y~0;~y~0 := 1 + #t~post1;havoc #t~post1; {257#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-17 22:52:04,105 INFO L280 TraceCheckUtils]: 8: Hoare triple {257#(<= (+ main_~x~0 53) (* 2 main_~y~0))} assume !(~x~0 < 0); {258#(<= 27 main_~y~0)} is VALID [2020-07-17 22:52:04,107 INFO L263 TraceCheckUtils]: 9: Hoare triple {258#(<= 27 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {291#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:52:04,108 INFO L280 TraceCheckUtils]: 10: Hoare triple {291#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {295#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:04,109 INFO L280 TraceCheckUtils]: 11: Hoare triple {295#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {252#false} is VALID [2020-07-17 22:52:04,109 INFO L280 TraceCheckUtils]: 12: Hoare triple {252#false} assume !false; {252#false} is VALID [2020-07-17 22:52:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:04,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:52:04,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-07-17 22:52:04,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949529500] [2020-07-17 22:52:04,111 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2020-07-17 22:52:04,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:04,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:52:04,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:04,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:52:04,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:04,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:52:04,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:52:04,134 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 10 states. [2020-07-17 22:52:04,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:04,344 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-17 22:52:04,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:52:04,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2020-07-17 22:52:04,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:04,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:52:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2020-07-17 22:52:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:52:04,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2020-07-17 22:52:04,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 20 transitions. [2020-07-17 22:52:04,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:04,376 INFO L225 Difference]: With dead ends: 20 [2020-07-17 22:52:04,376 INFO L226 Difference]: Without dead ends: 15 [2020-07-17 22:52:04,377 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:52:04,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-17 22:52:04,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-17 22:52:04,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:04,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-17 22:52:04,394 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-17 22:52:04,394 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-17 22:52:04,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:04,397 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-17 22:52:04,397 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-17 22:52:04,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:04,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:04,398 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-17 22:52:04,398 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-17 22:52:04,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:04,400 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-17 22:52:04,401 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-17 22:52:04,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:04,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:04,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:04,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:52:04,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2020-07-17 22:52:04,404 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2020-07-17 22:52:04,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:04,405 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2020-07-17 22:52:04,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:52:04,405 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-17 22:52:04,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 22:52:04,405 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:04,406 INFO L422 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:04,608 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:04,609 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:04,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:04,610 INFO L82 PathProgramCache]: Analyzing trace with hash -66279700, now seen corresponding path program 3 times [2020-07-17 22:52:04,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:04,611 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122827652] [2020-07-17 22:52:04,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:04,814 INFO L280 TraceCheckUtils]: 0: Hoare triple {392#true} assume true; {392#true} is VALID [2020-07-17 22:52:04,815 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {392#true} {392#true} #44#return; {392#true} is VALID [2020-07-17 22:52:04,815 INFO L263 TraceCheckUtils]: 0: Hoare triple {392#true} call ULTIMATE.init(); {392#true} is VALID [2020-07-17 22:52:04,815 INFO L280 TraceCheckUtils]: 1: Hoare triple {392#true} assume true; {392#true} is VALID [2020-07-17 22:52:04,816 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {392#true} {392#true} #44#return; {392#true} is VALID [2020-07-17 22:52:04,816 INFO L263 TraceCheckUtils]: 3: Hoare triple {392#true} call #t~ret2 := main(); {392#true} is VALID [2020-07-17 22:52:04,818 INFO L280 TraceCheckUtils]: 4: Hoare triple {392#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~y~0 := #t~nondet0;havoc #t~nondet0; {396#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-17 22:52:04,820 INFO L280 TraceCheckUtils]: 5: Hoare triple {396#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {396#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-17 22:52:04,821 INFO L280 TraceCheckUtils]: 6: Hoare triple {396#(<= (+ main_~x~0 50) 0)} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post1 := ~y~0;~y~0 := 1 + #t~post1;havoc #t~post1; {397#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-17 22:52:04,822 INFO L280 TraceCheckUtils]: 7: Hoare triple {397#(<= (+ main_~x~0 51) main_~y~0)} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post1 := ~y~0;~y~0 := 1 + #t~post1;havoc #t~post1; {398#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-17 22:52:04,823 INFO L280 TraceCheckUtils]: 8: Hoare triple {398#(<= (+ main_~x~0 53) (* 2 main_~y~0))} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post1 := ~y~0;~y~0 := 1 + #t~post1;havoc #t~post1; {399#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-17 22:52:04,824 INFO L280 TraceCheckUtils]: 9: Hoare triple {399#(<= (+ main_~x~0 56) (* 3 main_~y~0))} assume !(~x~0 < 0); {400#(<= 19 main_~y~0)} is VALID [2020-07-17 22:52:04,825 INFO L263 TraceCheckUtils]: 10: Hoare triple {400#(<= 19 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {401#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:52:04,827 INFO L280 TraceCheckUtils]: 11: Hoare triple {401#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {402#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:52:04,829 INFO L280 TraceCheckUtils]: 12: Hoare triple {402#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {393#false} is VALID [2020-07-17 22:52:04,829 INFO L280 TraceCheckUtils]: 13: Hoare triple {393#false} assume !false; {393#false} is VALID [2020-07-17 22:52:04,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:04,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122827652] [2020-07-17 22:52:04,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022422084] [2020-07-17 22:52:04,831 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:04,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-17 22:52:04,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:52:04,870 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:52:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:04,879 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:04,977 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:52:05,039 INFO L263 TraceCheckUtils]: 0: Hoare triple {392#true} call ULTIMATE.init(); {392#true} is VALID [2020-07-17 22:52:05,039 INFO L280 TraceCheckUtils]: 1: Hoare triple {392#true} assume true; {392#true} is VALID [2020-07-17 22:52:05,039 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {392#true} {392#true} #44#return; {392#true} is VALID [2020-07-17 22:52:05,040 INFO L263 TraceCheckUtils]: 3: Hoare triple {392#true} call #t~ret2 := main(); {392#true} is VALID [2020-07-17 22:52:05,040 INFO L280 TraceCheckUtils]: 4: Hoare triple {392#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~y~0 := #t~nondet0;havoc #t~nondet0; {392#true} is VALID [2020-07-17 22:52:05,040 INFO L280 TraceCheckUtils]: 5: Hoare triple {392#true} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {392#true} is VALID [2020-07-17 22:52:05,040 INFO L280 TraceCheckUtils]: 6: Hoare triple {392#true} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post1 := ~y~0;~y~0 := 1 + #t~post1;havoc #t~post1; {392#true} is VALID [2020-07-17 22:52:05,040 INFO L280 TraceCheckUtils]: 7: Hoare triple {392#true} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post1 := ~y~0;~y~0 := 1 + #t~post1;havoc #t~post1; {392#true} is VALID [2020-07-17 22:52:05,043 INFO L280 TraceCheckUtils]: 8: Hoare triple {392#true} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post1 := ~y~0;~y~0 := 1 + #t~post1;havoc #t~post1; {430#(<= (+ main_~x~0 2) main_~y~0)} is VALID [2020-07-17 22:52:05,045 INFO L280 TraceCheckUtils]: 9: Hoare triple {430#(<= (+ main_~x~0 2) main_~y~0)} assume !(~x~0 < 0); {434#(<= 2 main_~y~0)} is VALID [2020-07-17 22:52:05,049 INFO L263 TraceCheckUtils]: 10: Hoare triple {434#(<= 2 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {438#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:52:05,051 INFO L280 TraceCheckUtils]: 11: Hoare triple {438#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {442#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:05,051 INFO L280 TraceCheckUtils]: 12: Hoare triple {442#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {393#false} is VALID [2020-07-17 22:52:05,051 INFO L280 TraceCheckUtils]: 13: Hoare triple {393#false} assume !false; {393#false} is VALID [2020-07-17 22:52:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-17 22:52:05,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:52:05,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2020-07-17 22:52:05,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961984175] [2020-07-17 22:52:05,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-17 22:52:05,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:05,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:52:05,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:05,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:52:05,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:05,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:52:05,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:52:05,074 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 6 states. [2020-07-17 22:52:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:05,197 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-17 22:52:05,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:52:05,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-17 22:52:05,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:05,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:52:05,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2020-07-17 22:52:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:52:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2020-07-17 22:52:05,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 13 transitions. [2020-07-17 22:52:05,234 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:05,234 INFO L225 Difference]: With dead ends: 15 [2020-07-17 22:52:05,235 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:52:05,235 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2020-07-17 22:52:05,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:52:05,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:52:05,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:05,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:05,239 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:05,239 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:05,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:05,239 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:52:05,240 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:52:05,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:05,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:05,240 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:05,240 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:52:05,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:05,241 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:52:05,241 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:52:05,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:05,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:05,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:05,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:05,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:52:05,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:52:05,243 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2020-07-17 22:52:05,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:05,243 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:52:05,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:52:05,244 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:52:05,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:05,454 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:05,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:52:05,541 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:52:05,541 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:52:05,541 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:52:05,541 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:52:05,542 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:52:05,542 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:52:05,542 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:52:05,542 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-17 22:52:05,542 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:52:05,542 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:52:05,542 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 24) the Hoare annotation is: true [2020-07-17 22:52:05,542 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 24) no Hoare annotation was computed. [2020-07-17 22:52:05,543 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-07-17 22:52:05,543 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-17 22:52:05,543 INFO L264 CegarLoopResult]: At program point L18-2(lines 18 21) the Hoare annotation is: (or (<= (+ main_~x~0 50) 0) (<= (+ main_~x~0 2) main_~y~0)) [2020-07-17 22:52:05,543 INFO L264 CegarLoopResult]: At program point L18-3(lines 18 21) the Hoare annotation is: (or (and (<= 27 main_~y~0) (<= (+ main_~x~0 53) (* 2 main_~y~0))) (and (<= 2 main_~y~0) (<= (+ main_~x~0 2) main_~y~0))) [2020-07-17 22:52:05,543 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 24) no Hoare annotation was computed. [2020-07-17 22:52:05,543 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-17 22:52:05,544 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:52:05,544 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-17 22:52:05,544 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-17 22:52:05,544 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:52:05,544 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-17 22:52:05,551 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:52:05,551 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:52:05,551 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-17 22:52:05,552 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:52:05,552 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:52:05,552 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:52:05,552 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:52:05,552 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:52:05,552 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-17 22:52:05,553 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-17 22:52:05,553 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:52:05,553 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:52:05,553 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:52:05,553 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-17 22:52:05,553 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:52:05,559 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:52:05,559 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:52:05,560 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-17 22:52:05,560 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:52:05,560 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:52:05,560 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:52:05,561 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:52:05,561 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:52:05,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:52:05 BoogieIcfgContainer [2020-07-17 22:52:05,576 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:52:05,579 INFO L168 Benchmark]: Toolchain (without parser) took 4550.85 ms. Allocated memory was 146.3 MB in the beginning and 244.3 MB in the end (delta: 98.0 MB). Free memory was 104.3 MB in the beginning and 140.6 MB in the end (delta: -36.3 MB). Peak memory consumption was 61.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:05,580 INFO L168 Benchmark]: CDTParser took 0.59 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 22:52:05,581 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.95 ms. Allocated memory is still 146.3 MB. Free memory was 104.1 MB in the beginning and 94.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:05,582 INFO L168 Benchmark]: Boogie Preprocessor took 35.10 ms. Allocated memory is still 146.3 MB. Free memory was 94.5 MB in the beginning and 92.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:05,583 INFO L168 Benchmark]: RCFGBuilder took 424.11 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 92.9 MB in the beginning and 166.4 MB in the end (delta: -73.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:05,584 INFO L168 Benchmark]: TraceAbstraction took 3826.56 ms. Allocated memory was 203.9 MB in the beginning and 244.3 MB in the end (delta: 40.4 MB). Free memory was 166.4 MB in the beginning and 140.6 MB in the end (delta: 25.8 MB). Peak memory consumption was 66.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:05,588 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.59 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 257.95 ms. Allocated memory is still 146.3 MB. Free memory was 104.1 MB in the beginning and 94.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.10 ms. Allocated memory is still 146.3 MB. Free memory was 94.5 MB in the beginning and 92.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 424.11 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 92.9 MB in the beginning and 166.4 MB in the end (delta: -73.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3826.56 ms. Allocated memory was 203.9 MB in the beginning and 244.3 MB in the end (delta: 40.4 MB). Free memory was 166.4 MB in the beginning and 140.6 MB in the end (delta: 25.8 MB). Peak memory consumption was 66.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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: 18]: Loop Invariant Derived loop invariant: x + 50 <= 0 || x + 2 <= y - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.6s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 45 SDtfs, 9 SDslu, 131 SDs, 0 SdLazy, 91 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 16 NumberOfFragments, 37 HoareAnnotationTreeSize, 10 FomulaSimplifications, 24 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 89 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 2612 SizeOfPredicates, 9 NumberOfNonLiveVariables, 109 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 6/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...