java -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/psyco/psyco_io_1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:27:09,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:27:09,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:27:09,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:27:09,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:27:09,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:27:09,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:27:09,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:27:09,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:27:09,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:27:09,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:27:09,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:27:09,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:27:09,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:27:09,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:27:09,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:27:09,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:27:09,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:27:09,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:27:09,746 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:27:09,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:27:09,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:27:09,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:27:09,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:27:09,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:27:09,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:27:09,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:27:09,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:27:09,761 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:27:09,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:27:09,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:27:09,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:27:09,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:27:09,767 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:27:09,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:27:09,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:27:09,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:27:09,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:27:09,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:27:09,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:27:09,777 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:27:09,779 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 [2019-10-02 14:27:09,802 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:27:09,802 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:27:09,804 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:27:09,805 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:27:09,805 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:27:09,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:27:09,805 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:27:09,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:27:09,806 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:27:09,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:27:09,807 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:27:09,807 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:27:09,807 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:27:09,808 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:27:09,808 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:27:09,808 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:27:09,808 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:27:09,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:27:09,809 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:27:09,809 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:27:09,809 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:27:09,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:27:09,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:27:09,810 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:27:09,810 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:27:09,810 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:27:09,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:27:09,811 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:27:09,811 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:27:09,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:27:09,873 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:27:09,878 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:27:09,880 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:27:09,880 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:27:09,881 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_io_1.c [2019-10-02 14:27:09,958 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bce3350c/89f5ed92dbde4074946d97be7f6abf10/FLAGfac85ae0f [2019-10-02 14:27:10,394 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:27:10,395 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_io_1.c [2019-10-02 14:27:10,408 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bce3350c/89f5ed92dbde4074946d97be7f6abf10/FLAGfac85ae0f [2019-10-02 14:27:10,809 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bce3350c/89f5ed92dbde4074946d97be7f6abf10 [2019-10-02 14:27:10,822 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:27:10,824 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:27:10,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:27:10,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:27:10,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:27:10,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:27:10" (1/1) ... [2019-10-02 14:27:10,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d9af163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:10, skipping insertion in model container [2019-10-02 14:27:10,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:27:10" (1/1) ... [2019-10-02 14:27:10,839 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:27:10,869 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:27:11,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:27:11,166 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:27:11,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:27:11,302 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:27:11,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:11 WrapperNode [2019-10-02 14:27:11,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:27:11,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:27:11,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:27:11,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:27:11,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:11" (1/1) ... [2019-10-02 14:27:11,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:11" (1/1) ... [2019-10-02 14:27:11,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:11" (1/1) ... [2019-10-02 14:27:11,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:11" (1/1) ... [2019-10-02 14:27:11,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:11" (1/1) ... [2019-10-02 14:27:11,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:11" (1/1) ... [2019-10-02 14:27:11,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:11" (1/1) ... [2019-10-02 14:27:11,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:27:11,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:27:11,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:27:11,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:27:11,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:11" (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 [2019-10-02 14:27:11,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:27:11,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:27:11,423 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:27:11,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:27:11,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:27:11,424 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:27:11,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:27:11,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:27:11,892 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:27:11,892 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-02 14:27:11,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:27:11 BoogieIcfgContainer [2019-10-02 14:27:11,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:27:11,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:27:11,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:27:11,898 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:27:11,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:27:10" (1/3) ... [2019-10-02 14:27:11,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a2dfa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:27:11, skipping insertion in model container [2019-10-02 14:27:11,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:11" (2/3) ... [2019-10-02 14:27:11,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a2dfa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:27:11, skipping insertion in model container [2019-10-02 14:27:11,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:27:11" (3/3) ... [2019-10-02 14:27:11,902 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_io_1.c [2019-10-02 14:27:11,912 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:27:11,920 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:27:11,937 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:27:11,965 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:27:11,966 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:27:11,966 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:27:11,966 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:27:11,967 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:27:11,967 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:27:11,967 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:27:11,967 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:27:11,967 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:27:11,985 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-10-02 14:27:11,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-02 14:27:11,990 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:11,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:11,993 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:11,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:11,997 INFO L82 PathProgramCache]: Analyzing trace with hash -901605196, now seen corresponding path program 1 times [2019-10-02 14:27:11,999 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:11,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:12,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:12,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:12,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:12,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:12,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 14:27:12,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 14:27:12,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 14:27:12,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:27:12,153 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 2 states. [2019-10-02 14:27:12,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:12,183 INFO L93 Difference]: Finished difference Result 136 states and 250 transitions. [2019-10-02 14:27:12,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 14:27:12,185 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-10-02 14:27:12,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:12,196 INFO L225 Difference]: With dead ends: 136 [2019-10-02 14:27:12,196 INFO L226 Difference]: Without dead ends: 61 [2019-10-02 14:27:12,200 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:27:12,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-02 14:27:12,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-10-02 14:27:12,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-02 14:27:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 91 transitions. [2019-10-02 14:27:12,249 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 91 transitions. Word has length 13 [2019-10-02 14:27:12,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:12,250 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 91 transitions. [2019-10-02 14:27:12,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 14:27:12,251 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 91 transitions. [2019-10-02 14:27:12,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 14:27:12,252 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:12,252 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:12,252 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:12,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:12,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1647463811, now seen corresponding path program 1 times [2019-10-02 14:27:12,253 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:12,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:12,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:12,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:12,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:12,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:12,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:12,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:12,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:12,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:12,322 INFO L87 Difference]: Start difference. First operand 61 states and 91 transitions. Second operand 3 states. [2019-10-02 14:27:12,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:12,374 INFO L93 Difference]: Finished difference Result 119 states and 180 transitions. [2019-10-02 14:27:12,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:12,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-02 14:27:12,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:12,377 INFO L225 Difference]: With dead ends: 119 [2019-10-02 14:27:12,377 INFO L226 Difference]: Without dead ends: 64 [2019-10-02 14:27:12,379 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:12,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-02 14:27:12,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-10-02 14:27:12,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-02 14:27:12,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2019-10-02 14:27:12,389 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 14 [2019-10-02 14:27:12,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:12,390 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2019-10-02 14:27:12,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:12,390 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2019-10-02 14:27:12,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 14:27:12,392 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:12,392 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:12,392 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:12,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:12,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1212559863, now seen corresponding path program 1 times [2019-10-02 14:27:12,393 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:12,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:12,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:12,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:12,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:12,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:12,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:12,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:12,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:12,465 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand 3 states. [2019-10-02 14:27:12,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:12,534 INFO L93 Difference]: Finished difference Result 113 states and 169 transitions. [2019-10-02 14:27:12,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:12,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-02 14:27:12,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:12,536 INFO L225 Difference]: With dead ends: 113 [2019-10-02 14:27:12,536 INFO L226 Difference]: Without dead ends: 56 [2019-10-02 14:27:12,537 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:12,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-02 14:27:12,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-10-02 14:27:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-02 14:27:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2019-10-02 14:27:12,545 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 19 [2019-10-02 14:27:12,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:12,545 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2019-10-02 14:27:12,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2019-10-02 14:27:12,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 14:27:12,547 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:12,547 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:12,547 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:12,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:12,548 INFO L82 PathProgramCache]: Analyzing trace with hash -2054021688, now seen corresponding path program 1 times [2019-10-02 14:27:12,548 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:12,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:12,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:12,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:12,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:12,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:12,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:12,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:12,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:12,627 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand 3 states. [2019-10-02 14:27:12,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:12,689 INFO L93 Difference]: Finished difference Result 140 states and 210 transitions. [2019-10-02 14:27:12,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:12,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-02 14:27:12,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:12,691 INFO L225 Difference]: With dead ends: 140 [2019-10-02 14:27:12,691 INFO L226 Difference]: Without dead ends: 94 [2019-10-02 14:27:12,692 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:12,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-02 14:27:12,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2019-10-02 14:27:12,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-02 14:27:12,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 132 transitions. [2019-10-02 14:27:12,703 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 132 transitions. Word has length 24 [2019-10-02 14:27:12,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:12,704 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 132 transitions. [2019-10-02 14:27:12,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:12,704 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 132 transitions. [2019-10-02 14:27:12,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 14:27:12,705 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:12,705 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:12,706 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:12,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:12,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1279925660, now seen corresponding path program 1 times [2019-10-02 14:27:12,706 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:12,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:12,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:12,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:12,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:12,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:12,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:12,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:12,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:12,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:12,755 INFO L87 Difference]: Start difference. First operand 91 states and 132 transitions. Second operand 3 states. [2019-10-02 14:27:12,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:12,805 INFO L93 Difference]: Finished difference Result 180 states and 262 transitions. [2019-10-02 14:27:12,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:12,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-02 14:27:12,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:12,809 INFO L225 Difference]: With dead ends: 180 [2019-10-02 14:27:12,810 INFO L226 Difference]: Without dead ends: 101 [2019-10-02 14:27:12,811 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:12,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-02 14:27:12,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-10-02 14:27:12,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-02 14:27:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2019-10-02 14:27:12,834 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 25 [2019-10-02 14:27:12,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:12,835 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2019-10-02 14:27:12,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:12,835 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2019-10-02 14:27:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-02 14:27:12,840 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:12,841 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:12,841 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:12,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:12,842 INFO L82 PathProgramCache]: Analyzing trace with hash -964230168, now seen corresponding path program 1 times [2019-10-02 14:27:12,842 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:12,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:12,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:12,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:12,961 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 14:27:12,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:12,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:12,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:12,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:12,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:12,963 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand 3 states. [2019-10-02 14:27:13,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:13,002 INFO L93 Difference]: Finished difference Result 164 states and 234 transitions. [2019-10-02 14:27:13,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:13,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-02 14:27:13,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:13,006 INFO L225 Difference]: With dead ends: 164 [2019-10-02 14:27:13,006 INFO L226 Difference]: Without dead ends: 77 [2019-10-02 14:27:13,007 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:13,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-02 14:27:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-10-02 14:27:13,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-02 14:27:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 105 transitions. [2019-10-02 14:27:13,027 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 105 transitions. Word has length 36 [2019-10-02 14:27:13,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:13,028 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 105 transitions. [2019-10-02 14:27:13,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 105 transitions. [2019-10-02 14:27:13,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-02 14:27:13,031 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:13,033 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:13,033 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:13,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:13,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1856126908, now seen corresponding path program 1 times [2019-10-02 14:27:13,035 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:13,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:13,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:13,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:13,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 14:27:13,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:13,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:27:13,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:27:13,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:27:13,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:27:13,150 INFO L87 Difference]: Start difference. First operand 77 states and 105 transitions. Second operand 4 states. [2019-10-02 14:27:13,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:13,204 INFO L93 Difference]: Finished difference Result 80 states and 108 transitions. [2019-10-02 14:27:13,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:27:13,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-10-02 14:27:13,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:13,205 INFO L225 Difference]: With dead ends: 80 [2019-10-02 14:27:13,205 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 14:27:13,206 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:27:13,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 14:27:13,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 14:27:13,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 14:27:13,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 14:27:13,207 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-10-02 14:27:13,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:13,212 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 14:27:13,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:27:13,212 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 14:27:13,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 14:27:13,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 14:27:13,315 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 14:27:13,316 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-02 14:27:13,316 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 14:27:13,316 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 14:27:13,316 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 14:27:13,316 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 14:27:13,316 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 14:27:13,317 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 13 344) no Hoare annotation was computed. [2019-10-02 14:27:13,317 INFO L443 ceAbstractionStarter]: For program point L36(lines 36 47) no Hoare annotation was computed. [2019-10-02 14:27:13,317 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 101) no Hoare annotation was computed. [2019-10-02 14:27:13,318 INFO L443 ceAbstractionStarter]: For program point L53(lines 53 104) no Hoare annotation was computed. [2019-10-02 14:27:13,318 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 217) no Hoare annotation was computed. [2019-10-02 14:27:13,318 INFO L443 ceAbstractionStarter]: For program point L70(lines 70 85) no Hoare annotation was computed. [2019-10-02 14:27:13,318 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 333) no Hoare annotation was computed. [2019-10-02 14:27:13,318 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 201) no Hoare annotation was computed. [2019-10-02 14:27:13,318 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 69) no Hoare annotation was computed. [2019-10-02 14:27:13,319 INFO L439 ceAbstractionStarter]: At program point L335(lines 23 339) the Hoare annotation is: (let ((.cse0 (= main_~this_sink~0 0))) (or (and (= 2 main_~q~0) .cse0) (and (= main_~q~0 0) .cse0) (and (<= 3 main_~q~0) (not .cse0)))) [2019-10-02 14:27:13,319 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 317) no Hoare annotation was computed. [2019-10-02 14:27:13,319 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 13 344) no Hoare annotation was computed. [2019-10-02 14:27:13,319 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 185) no Hoare annotation was computed. [2019-10-02 14:27:13,319 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 301) no Hoare annotation was computed. [2019-10-02 14:27:13,319 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 169) no Hoare annotation was computed. [2019-10-02 14:27:13,319 INFO L443 ceAbstractionStarter]: For program point L88(lines 88 99) no Hoare annotation was computed. [2019-10-02 14:27:13,320 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 285) no Hoare annotation was computed. [2019-10-02 14:27:13,320 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 215) no Hoare annotation was computed. [2019-10-02 14:27:13,320 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 153) no Hoare annotation was computed. [2019-10-02 14:27:13,320 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 220) no Hoare annotation was computed. [2019-10-02 14:27:13,321 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 83) no Hoare annotation was computed. [2019-10-02 14:27:13,321 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 331) no Hoare annotation was computed. [2019-10-02 14:27:13,321 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 269) no Hoare annotation was computed. [2019-10-02 14:27:13,322 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 336) no Hoare annotation was computed. [2019-10-02 14:27:13,322 INFO L443 ceAbstractionStarter]: For program point L188(lines 188 199) no Hoare annotation was computed. [2019-10-02 14:27:13,322 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 137) no Hoare annotation was computed. [2019-10-02 14:27:13,322 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 67) no Hoare annotation was computed. [2019-10-02 14:27:13,322 INFO L439 ceAbstractionStarter]: At program point L23-2(lines 23 339) the Hoare annotation is: (let ((.cse0 (= main_~this_sink~0 0))) (or (and (= main_~q~0 0) .cse0) (and (<= 3 main_~q~0) (not .cse0)))) [2019-10-02 14:27:13,323 INFO L443 ceAbstractionStarter]: For program point L23-3(lines 23 339) no Hoare annotation was computed. [2019-10-02 14:27:13,323 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 315) no Hoare annotation was computed. [2019-10-02 14:27:13,324 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 253) no Hoare annotation was computed. [2019-10-02 14:27:13,324 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 183) no Hoare annotation was computed. [2019-10-02 14:27:13,324 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 121) no Hoare annotation was computed. [2019-10-02 14:27:13,324 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 42) no Hoare annotation was computed. [2019-10-02 14:27:13,324 INFO L443 ceAbstractionStarter]: For program point L288(lines 288 299) no Hoare annotation was computed. [2019-10-02 14:27:13,324 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 237) no Hoare annotation was computed. [2019-10-02 14:27:13,324 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 167) no Hoare annotation was computed. [2019-10-02 14:27:13,324 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 283) no Hoare annotation was computed. [2019-10-02 14:27:13,325 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 151) no Hoare annotation was computed. [2019-10-02 14:27:13,325 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 267) no Hoare annotation was computed. [2019-10-02 14:27:13,325 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 135) no Hoare annotation was computed. [2019-10-02 14:27:13,325 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 251) no Hoare annotation was computed. [2019-10-02 14:27:13,325 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 119) no Hoare annotation was computed. [2019-10-02 14:27:13,326 INFO L443 ceAbstractionStarter]: For program point L224(lines 224 235) no Hoare annotation was computed. [2019-10-02 14:27:13,326 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 94) no Hoare annotation was computed. [2019-10-02 14:27:13,326 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 210) no Hoare annotation was computed. [2019-10-02 14:27:13,326 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 343) no Hoare annotation was computed. [2019-10-02 14:27:13,326 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2019-10-02 14:27:13,326 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-10-02 14:27:13,327 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 194) no Hoare annotation was computed. [2019-10-02 14:27:13,327 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 62) no Hoare annotation was computed. [2019-10-02 14:27:13,327 INFO L443 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2019-10-02 14:27:13,327 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 178) no Hoare annotation was computed. [2019-10-02 14:27:13,328 INFO L439 ceAbstractionStarter]: At program point L325(lines 13 344) the Hoare annotation is: false [2019-10-02 14:27:13,328 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 294) no Hoare annotation was computed. [2019-10-02 14:27:13,328 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 162) no Hoare annotation was computed. [2019-10-02 14:27:13,328 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 278) no Hoare annotation was computed. [2019-10-02 14:27:13,328 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 146) no Hoare annotation was computed. [2019-10-02 14:27:13,329 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 262) no Hoare annotation was computed. [2019-10-02 14:27:13,329 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 130) no Hoare annotation was computed. [2019-10-02 14:27:13,330 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 246) no Hoare annotation was computed. [2019-10-02 14:27:13,331 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 114) no Hoare annotation was computed. [2019-10-02 14:27:13,331 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 230) no Hoare annotation was computed. [2019-10-02 14:27:13,331 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 13 344) the Hoare annotation is: true [2019-10-02 14:27:13,331 INFO L443 ceAbstractionStarter]: For program point L33(lines 33 52) no Hoare annotation was computed. [2019-10-02 14:27:13,331 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 49) no Hoare annotation was computed. [2019-10-02 14:27:13,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 02:27:13 BoogieIcfgContainer [2019-10-02 14:27:13,355 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 14:27:13,359 INFO L168 Benchmark]: Toolchain (without parser) took 2532.71 ms. Allocated memory was 129.5 MB in the beginning and 213.9 MB in the end (delta: 84.4 MB). Free memory was 84.8 MB in the beginning and 157.6 MB in the end (delta: -72.8 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2019-10-02 14:27:13,360 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 129.5 MB. Free memory was 103.8 MB in the beginning and 103.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 14:27:13,362 INFO L168 Benchmark]: CACSL2BoogieTranslator took 478.77 ms. Allocated memory was 129.5 MB in the beginning and 197.1 MB in the end (delta: 67.6 MB). Free memory was 84.6 MB in the beginning and 173.1 MB in the end (delta: -88.4 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2019-10-02 14:27:13,364 INFO L168 Benchmark]: Boogie Preprocessor took 40.32 ms. Allocated memory is still 197.1 MB. Free memory was 173.1 MB in the beginning and 171.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-10-02 14:27:13,365 INFO L168 Benchmark]: RCFGBuilder took 549.88 ms. Allocated memory is still 197.1 MB. Free memory was 171.1 MB in the beginning and 143.4 MB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2019-10-02 14:27:13,367 INFO L168 Benchmark]: TraceAbstraction took 1459.69 ms. Allocated memory was 197.1 MB in the beginning and 213.9 MB in the end (delta: 16.8 MB). Free memory was 143.4 MB in the beginning and 157.6 MB in the end (delta: -14.2 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-10-02 14:27:13,377 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 129.5 MB. Free memory was 103.8 MB in the beginning and 103.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 478.77 ms. Allocated memory was 129.5 MB in the beginning and 197.1 MB in the end (delta: 67.6 MB). Free memory was 84.6 MB in the beginning and 173.1 MB in the end (delta: -88.4 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.32 ms. Allocated memory is still 197.1 MB. Free memory was 173.1 MB in the beginning and 171.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 549.88 ms. Allocated memory is still 197.1 MB. Free memory was 171.1 MB in the beginning and 143.4 MB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1459.69 ms. Allocated memory was 197.1 MB in the beginning and 213.9 MB in the end (delta: 16.8 MB). Free memory was 143.4 MB in the beginning and 157.6 MB in the end (delta: -14.2 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 343]: 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: 23]: Loop Invariant Derived loop invariant: ((2 == q && this_sink == 0) || (q == 0 && this_sink == 0)) || (3 <= q && !(this_sink == 0)) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (q == 0 && this_sink == 0) || (3 <= q && !(this_sink == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 locations, 1 error locations. SAFE Result, 1.3s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 549 SDtfs, 190 SDslu, 291 SDs, 0 SdLazy, 87 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 14 NumberOfFragments, 44 HoareAnnotationTreeSize, 7 FomulaSimplifications, 29 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 6831 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 27/27 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...