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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/psyco/psyco_abp_1-3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:22:07,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:22:07,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:22:07,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:22:07,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:22:07,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:22:07,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:22:07,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:22:07,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:22:07,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:22:07,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:22:07,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:22:07,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:22:07,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:22:07,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:22:07,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:22:07,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:22:07,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:22:07,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:22:07,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:22:07,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:22:07,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:22:07,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:22:07,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:22:07,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:22:07,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:22:07,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:22:07,654 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:22:07,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:22:07,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:22:07,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:22:07,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:22:07,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:22:07,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:22:07,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:22:07,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:22:07,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:22:07,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:22:07,660 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:22:07,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:22:07,662 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:22:07,663 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-15 01:22:07,683 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:22:07,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:22:07,685 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:22:07,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:22:07,686 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:22:07,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:22:07,686 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:22:07,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:22:07,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:22:07,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:22:07,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:22:07,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:22:07,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:22:07,689 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:22:07,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:22:07,689 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:22:07,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:22:07,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:22:07,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:22:07,690 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:22:07,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:22:07,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:22:07,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:22:07,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:22:07,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:22:07,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:22:07,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:22:07,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:22:07,692 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:22:07,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:22:08,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:22:08,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:22:08,014 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:22:08,014 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:22:08,015 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1-3.c [2019-10-15 01:22:08,100 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86097dd7/5407315961234987a7722f335198f583/FLAGe729ca8f5 [2019-10-15 01:22:08,639 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:22:08,640 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-3.c [2019-10-15 01:22:08,652 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86097dd7/5407315961234987a7722f335198f583/FLAGe729ca8f5 [2019-10-15 01:22:08,907 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86097dd7/5407315961234987a7722f335198f583 [2019-10-15 01:22:08,917 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:22:08,920 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:22:08,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:08,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:22:08,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:22:08,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:08" (1/1) ... [2019-10-15 01:22:08,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c92307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:08, skipping insertion in model container [2019-10-15 01:22:08,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:08" (1/1) ... [2019-10-15 01:22:08,937 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:22:08,976 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:22:09,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:09,302 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:22:09,479 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:09,495 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:22:09,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:09 WrapperNode [2019-10-15 01:22:09,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:09,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:22:09,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:22:09,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:22:09,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:09" (1/1) ... [2019-10-15 01:22:09,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:09" (1/1) ... [2019-10-15 01:22:09,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:09" (1/1) ... [2019-10-15 01:22:09,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:09" (1/1) ... [2019-10-15 01:22:09,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:09" (1/1) ... [2019-10-15 01:22:09,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:09" (1/1) ... [2019-10-15 01:22:09,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:09" (1/1) ... [2019-10-15 01:22:09,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:22:09,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:22:09,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:22:09,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:22:09,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:09" (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-15 01:22:09,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:22:09,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:22:09,649 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:22:09,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:22:09,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:22:09,650 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:22:09,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:22:09,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:22:10,607 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:22:10,607 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-15 01:22:10,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:10 BoogieIcfgContainer [2019-10-15 01:22:10,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:22:10,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:22:10,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:22:10,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:22:10,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:22:08" (1/3) ... [2019-10-15 01:22:10,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@beca09a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:10, skipping insertion in model container [2019-10-15 01:22:10,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:09" (2/3) ... [2019-10-15 01:22:10,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@beca09a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:10, skipping insertion in model container [2019-10-15 01:22:10,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:10" (3/3) ... [2019-10-15 01:22:10,619 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-3.c [2019-10-15 01:22:10,631 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:22:10,642 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:22:10,656 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:22:10,685 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:22:10,686 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:22:10,686 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:22:10,686 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:22:10,687 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:22:10,687 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:22:10,687 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:22:10,687 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:22:10,712 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2019-10-15 01:22:10,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 01:22:10,720 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:10,722 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:10,724 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:10,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:10,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1483071650, now seen corresponding path program 1 times [2019-10-15 01:22:10,741 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:10,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164654946] [2019-10-15 01:22:10,742 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:10,742 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:10,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:10,899 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-15 01:22:10,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164654946] [2019-10-15 01:22:10,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:10,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 01:22:10,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090540522] [2019-10-15 01:22:10,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 01:22:10,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:10,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 01:22:10,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:22:10,928 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states. [2019-10-15 01:22:10,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:10,968 INFO L93 Difference]: Finished difference Result 222 states and 422 transitions. [2019-10-15 01:22:10,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 01:22:10,970 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-10-15 01:22:10,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:10,983 INFO L225 Difference]: With dead ends: 222 [2019-10-15 01:22:10,984 INFO L226 Difference]: Without dead ends: 104 [2019-10-15 01:22:10,988 INFO L600 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-15 01:22:11,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-15 01:22:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-10-15 01:22:11,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-15 01:22:11,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2019-10-15 01:22:11,039 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 13 [2019-10-15 01:22:11,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:11,040 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2019-10-15 01:22:11,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 01:22:11,041 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2019-10-15 01:22:11,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 01:22:11,042 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:11,042 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:11,043 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:11,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:11,043 INFO L82 PathProgramCache]: Analyzing trace with hash -736931587, now seen corresponding path program 1 times [2019-10-15 01:22:11,044 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:11,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187179451] [2019-10-15 01:22:11,044 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:11,044 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:11,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:11,117 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-15 01:22:11,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187179451] [2019-10-15 01:22:11,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:11,121 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:11,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714428644] [2019-10-15 01:22:11,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:11,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:11,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:11,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:11,125 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2019-10-15 01:22:11,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:11,234 INFO L93 Difference]: Finished difference Result 205 states and 336 transitions. [2019-10-15 01:22:11,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:11,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-15 01:22:11,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:11,237 INFO L225 Difference]: With dead ends: 205 [2019-10-15 01:22:11,237 INFO L226 Difference]: Without dead ends: 107 [2019-10-15 01:22:11,241 INFO L600 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-15 01:22:11,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-15 01:22:11,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-10-15 01:22:11,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-15 01:22:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 172 transitions. [2019-10-15 01:22:11,268 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 172 transitions. Word has length 14 [2019-10-15 01:22:11,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:11,269 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 172 transitions. [2019-10-15 01:22:11,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:11,269 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2019-10-15 01:22:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:22:11,271 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:11,272 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:11,272 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:11,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:11,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1504395429, now seen corresponding path program 1 times [2019-10-15 01:22:11,273 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:11,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534908761] [2019-10-15 01:22:11,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:11,274 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:11,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:13,969 WARN L191 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 113 DAG size of output: 41 [2019-10-15 01:22:13,975 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-15 01:22:13,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534908761] [2019-10-15 01:22:13,976 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:13,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:13,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743026839] [2019-10-15 01:22:13,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:13,977 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:13,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:13,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:13,978 INFO L87 Difference]: Start difference. First operand 107 states and 172 transitions. Second operand 4 states. [2019-10-15 01:22:14,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:14,392 INFO L93 Difference]: Finished difference Result 209 states and 338 transitions. [2019-10-15 01:22:14,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:14,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-15 01:22:14,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:14,395 INFO L225 Difference]: With dead ends: 209 [2019-10-15 01:22:14,395 INFO L226 Difference]: Without dead ends: 190 [2019-10-15 01:22:14,396 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:14,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-15 01:22:14,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2019-10-15 01:22:14,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-10-15 01:22:14,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 285 transitions. [2019-10-15 01:22:14,421 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 285 transitions. Word has length 19 [2019-10-15 01:22:14,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:14,421 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 285 transitions. [2019-10-15 01:22:14,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions. [2019-10-15 01:22:14,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:22:14,423 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:14,423 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:14,423 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:14,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:14,424 INFO L82 PathProgramCache]: Analyzing trace with hash 2142865338, now seen corresponding path program 1 times [2019-10-15 01:22:14,424 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:14,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037707182] [2019-10-15 01:22:14,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:14,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:14,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:14,482 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-15 01:22:14,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037707182] [2019-10-15 01:22:14,483 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:14,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:14,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761262645] [2019-10-15 01:22:14,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:14,484 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:14,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:14,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:14,485 INFO L87 Difference]: Start difference. First operand 176 states and 285 transitions. Second operand 3 states. [2019-10-15 01:22:14,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:14,524 INFO L93 Difference]: Finished difference Result 297 states and 481 transitions. [2019-10-15 01:22:14,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:14,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-15 01:22:14,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:14,527 INFO L225 Difference]: With dead ends: 297 [2019-10-15 01:22:14,527 INFO L226 Difference]: Without dead ends: 128 [2019-10-15 01:22:14,531 INFO L600 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-15 01:22:14,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-15 01:22:14,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2019-10-15 01:22:14,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-15 01:22:14,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2019-10-15 01:22:14,552 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 20 [2019-10-15 01:22:14,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:14,553 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions. [2019-10-15 01:22:14,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:14,556 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2019-10-15 01:22:14,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:22:14,558 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:14,558 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:14,558 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:14,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:14,559 INFO L82 PathProgramCache]: Analyzing trace with hash -2011475352, now seen corresponding path program 1 times [2019-10-15 01:22:14,561 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:14,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220716529] [2019-10-15 01:22:14,562 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:14,562 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:14,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:14,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:22:14,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220716529] [2019-10-15 01:22:14,635 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:14,635 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:14,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115880009] [2019-10-15 01:22:14,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:14,636 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:14,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:14,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:14,638 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 3 states. [2019-10-15 01:22:14,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:14,680 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions. [2019-10-15 01:22:14,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:14,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:22:14,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:14,683 INFO L225 Difference]: With dead ends: 230 [2019-10-15 01:22:14,683 INFO L226 Difference]: Without dead ends: 111 [2019-10-15 01:22:14,686 INFO L600 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-15 01:22:14,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-15 01:22:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2019-10-15 01:22:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-15 01:22:14,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2019-10-15 01:22:14,700 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 25 [2019-10-15 01:22:14,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:14,700 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2019-10-15 01:22:14,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:14,701 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2019-10-15 01:22:14,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:22:14,706 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:14,706 INFO L380 BasicCegarLoop]: trace histogram [3, 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-15 01:22:14,707 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:14,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:14,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1818456969, now seen corresponding path program 1 times [2019-10-15 01:22:14,708 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:14,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852778909] [2019-10-15 01:22:14,708 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:14,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:14,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:21,155 WARN L191 SmtUtils]: Spent 6.22 s on a formula simplification. DAG size of input: 80 DAG size of output: 27 [2019-10-15 01:22:21,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:21,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852778909] [2019-10-15 01:22:21,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478341722] [2019-10-15 01:22:21,163 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 [2019-10-15 01:22:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:21,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:22:21,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:22:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:21,300 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:22:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:21,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [670288181] [2019-10-15 01:22:21,362 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 28 [2019-10-15 01:22:21,408 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:22:21,408 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:22:21,589 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:22:22,394 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:22:22,398 INFO L272 AbstractInterpreter]: Visited 24 different actions 48 times. Merged at 15 different actions 19 times. Never widened. Performed 264 root evaluator evaluations with a maximum evaluation depth of 16. Performed 264 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 4 fixpoints after 3 different actions. Largest state had 39 variables. [2019-10-15 01:22:22,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:22,408 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:22:22,409 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:22:22,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2019-10-15 01:22:22,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003975696] [2019-10-15 01:22:22,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:22:22,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:22,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:22:22,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:22:22,417 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand 9 states. [2019-10-15 01:22:23,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:23,298 INFO L93 Difference]: Finished difference Result 363 states and 568 transitions. [2019-10-15 01:22:23,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:22:23,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-10-15 01:22:23,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:23,301 INFO L225 Difference]: With dead ends: 363 [2019-10-15 01:22:23,302 INFO L226 Difference]: Without dead ends: 323 [2019-10-15 01:22:23,303 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-10-15 01:22:23,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-10-15 01:22:23,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 279. [2019-10-15 01:22:23,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-10-15 01:22:23,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 438 transitions. [2019-10-15 01:22:23,320 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 438 transitions. Word has length 27 [2019-10-15 01:22:23,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:23,321 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 438 transitions. [2019-10-15 01:22:23,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:22:23,321 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 438 transitions. [2019-10-15 01:22:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:22:23,323 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:23,323 INFO L380 BasicCegarLoop]: trace histogram [3, 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] [2019-10-15 01:22:23,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:23,525 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:23,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:23,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1113591962, now seen corresponding path program 1 times [2019-10-15 01:22:23,526 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:23,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953450698] [2019-10-15 01:22:23,527 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:23,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:23,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:23,573 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:22:23,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953450698] [2019-10-15 01:22:23,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:23,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:23,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109530582] [2019-10-15 01:22:23,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:23,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:23,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:23,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:23,576 INFO L87 Difference]: Start difference. First operand 279 states and 438 transitions. Second operand 3 states. [2019-10-15 01:22:23,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:23,614 INFO L93 Difference]: Finished difference Result 552 states and 865 transitions. [2019-10-15 01:22:23,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:23,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-15 01:22:23,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:23,617 INFO L225 Difference]: With dead ends: 552 [2019-10-15 01:22:23,617 INFO L226 Difference]: Without dead ends: 301 [2019-10-15 01:22:23,618 INFO L600 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-15 01:22:23,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-15 01:22:23,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2019-10-15 01:22:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-10-15 01:22:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 458 transitions. [2019-10-15 01:22:23,632 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 458 transitions. Word has length 29 [2019-10-15 01:22:23,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:23,632 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 458 transitions. [2019-10-15 01:22:23,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 458 transitions. [2019-10-15 01:22:23,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:22:23,633 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:23,634 INFO L380 BasicCegarLoop]: trace histogram [3, 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] [2019-10-15 01:22:23,634 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:23,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:23,634 INFO L82 PathProgramCache]: Analyzing trace with hash 454582667, now seen corresponding path program 1 times [2019-10-15 01:22:23,635 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:23,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330036676] [2019-10-15 01:22:23,635 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:23,635 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:23,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:23,982 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 27 [2019-10-15 01:22:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:23,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330036676] [2019-10-15 01:22:23,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19854817] [2019-10-15 01:22:23,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:24,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:22:24,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:22:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:22:24,103 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:22:24,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:22:24,234 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:22:24,236 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:22:24,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-10-15 01:22:24,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281284175] [2019-10-15 01:22:24,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:24,238 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:24,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:24,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:22:24,239 INFO L87 Difference]: Start difference. First operand 299 states and 458 transitions. Second operand 4 states. [2019-10-15 01:22:24,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:24,282 INFO L93 Difference]: Finished difference Result 302 states and 460 transitions. [2019-10-15 01:22:24,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:24,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-10-15 01:22:24,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:24,286 INFO L225 Difference]: With dead ends: 302 [2019-10-15 01:22:24,286 INFO L226 Difference]: Without dead ends: 296 [2019-10-15 01:22:24,287 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:22:24,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-15 01:22:24,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2019-10-15 01:22:24,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-15 01:22:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 446 transitions. [2019-10-15 01:22:24,300 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 446 transitions. Word has length 31 [2019-10-15 01:22:24,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:24,300 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 446 transitions. [2019-10-15 01:22:24,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 446 transitions. [2019-10-15 01:22:24,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-15 01:22:24,304 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:24,305 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:24,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:24,518 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:24,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:24,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1646630523, now seen corresponding path program 1 times [2019-10-15 01:22:24,519 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:24,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192267486] [2019-10-15 01:22:24,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:24,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:24,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:24,570 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-15 01:22:24,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192267486] [2019-10-15 01:22:24,571 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:24,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:24,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431696042] [2019-10-15 01:22:24,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:24,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:24,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:24,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:24,573 INFO L87 Difference]: Start difference. First operand 295 states and 446 transitions. Second operand 3 states. [2019-10-15 01:22:24,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:24,611 INFO L93 Difference]: Finished difference Result 514 states and 779 transitions. [2019-10-15 01:22:24,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:24,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-10-15 01:22:24,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:24,613 INFO L225 Difference]: With dead ends: 514 [2019-10-15 01:22:24,614 INFO L226 Difference]: Without dead ends: 247 [2019-10-15 01:22:24,615 INFO L600 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-15 01:22:24,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-15 01:22:24,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2019-10-15 01:22:24,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-10-15 01:22:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 365 transitions. [2019-10-15 01:22:24,624 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 365 transitions. Word has length 37 [2019-10-15 01:22:24,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:24,625 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 365 transitions. [2019-10-15 01:22:24,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:24,625 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 365 transitions. [2019-10-15 01:22:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 01:22:24,626 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:24,626 INFO L380 BasicCegarLoop]: trace histogram [4, 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-15 01:22:24,626 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:24,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:24,626 INFO L82 PathProgramCache]: Analyzing trace with hash -819577482, now seen corresponding path program 1 times [2019-10-15 01:22:24,627 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:24,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825230548] [2019-10-15 01:22:24,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:24,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:24,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-15 01:22:24,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825230548] [2019-10-15 01:22:24,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:24,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:24,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146811372] [2019-10-15 01:22:24,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:24,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:24,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:24,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:24,688 INFO L87 Difference]: Start difference. First operand 245 states and 365 transitions. Second operand 3 states. [2019-10-15 01:22:24,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:24,726 INFO L93 Difference]: Finished difference Result 428 states and 636 transitions. [2019-10-15 01:22:24,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:24,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-15 01:22:24,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:24,730 INFO L225 Difference]: With dead ends: 428 [2019-10-15 01:22:24,730 INFO L226 Difference]: Without dead ends: 229 [2019-10-15 01:22:24,731 INFO L600 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-15 01:22:24,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-15 01:22:24,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2019-10-15 01:22:24,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-15 01:22:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2019-10-15 01:22:24,742 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 41 [2019-10-15 01:22:24,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:24,742 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2019-10-15 01:22:24,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2019-10-15 01:22:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 01:22:24,744 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:24,744 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 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] [2019-10-15 01:22:24,744 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:24,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:24,744 INFO L82 PathProgramCache]: Analyzing trace with hash 711556807, now seen corresponding path program 1 times [2019-10-15 01:22:24,745 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:24,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456636310] [2019-10-15 01:22:24,745 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:24,745 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:24,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:24,825 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 01:22:24,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456636310] [2019-10-15 01:22:24,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:24,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:24,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838700479] [2019-10-15 01:22:24,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:24,826 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:24,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:24,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:24,827 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand 3 states. [2019-10-15 01:22:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:24,860 INFO L93 Difference]: Finished difference Result 309 states and 446 transitions. [2019-10-15 01:22:24,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:24,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-15 01:22:24,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:24,863 INFO L225 Difference]: With dead ends: 309 [2019-10-15 01:22:24,863 INFO L226 Difference]: Without dead ends: 147 [2019-10-15 01:22:24,864 INFO L600 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-15 01:22:24,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-15 01:22:24,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2019-10-15 01:22:24,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-15 01:22:24,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 203 transitions. [2019-10-15 01:22:24,870 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 203 transitions. Word has length 50 [2019-10-15 01:22:24,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:24,871 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 203 transitions. [2019-10-15 01:22:24,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:24,871 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 203 transitions. [2019-10-15 01:22:24,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 01:22:24,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:24,872 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 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, 1, 1, 1, 1] [2019-10-15 01:22:24,872 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:24,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:24,872 INFO L82 PathProgramCache]: Analyzing trace with hash -370372205, now seen corresponding path program 1 times [2019-10-15 01:22:24,873 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:24,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867496848] [2019-10-15 01:22:24,873 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:24,873 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:24,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:25,135 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 01:22:25,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867496848] [2019-10-15 01:22:25,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247574963] [2019-10-15 01:22:25,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-10-15 01:22:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:25,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-15 01:22:25,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:22:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:25,303 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:22:25,431 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:25,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1715592985] [2019-10-15 01:22:25,432 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 52 [2019-10-15 01:22:25,440 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:22:25,440 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:22:25,467 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:22:34,355 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:22:34,356 INFO L272 AbstractInterpreter]: Visited 39 different actions 341 times. Merged at 32 different actions 263 times. Widened at 4 different actions 11 times. Performed 1452 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1452 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 36 fixpoints after 9 different actions. Largest state had 46 variables. [2019-10-15 01:22:34,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:34,356 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:22:34,357 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:22:34,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2019-10-15 01:22:34,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766447966] [2019-10-15 01:22:34,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-15 01:22:34,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:34,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-15 01:22:34,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:22:34,359 INFO L87 Difference]: Start difference. First operand 145 states and 203 transitions. Second operand 14 states. [2019-10-15 01:22:34,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:34,649 INFO L93 Difference]: Finished difference Result 167 states and 235 transitions. [2019-10-15 01:22:34,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:22:34,649 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2019-10-15 01:22:34,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:34,650 INFO L225 Difference]: With dead ends: 167 [2019-10-15 01:22:34,650 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:22:34,653 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:22:34,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:22:34,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:22:34,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:22:34,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:22:34,654 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2019-10-15 01:22:34,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:34,655 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:22:34,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-15 01:22:34,655 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:22:34,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:22:34,859 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:22:34,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:22:35,126 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2019-10-15 01:22:35,129 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:22:35,130 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:22:35,130 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:22:35,130 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:22:35,130 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 01:22:35,130 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:22:35,130 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:22:35,131 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 14 566) no Hoare annotation was computed. [2019-10-15 01:22:35,131 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed. [2019-10-15 01:22:35,131 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2019-10-15 01:22:35,131 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-10-15 01:22:35,131 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 14 566) no Hoare annotation was computed. [2019-10-15 01:22:35,131 INFO L443 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed. [2019-10-15 01:22:35,131 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed. [2019-10-15 01:22:35,132 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed. [2019-10-15 01:22:35,132 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed. [2019-10-15 01:22:35,132 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed. [2019-10-15 01:22:35,132 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed. [2019-10-15 01:22:35,132 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed. [2019-10-15 01:22:35,132 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed. [2019-10-15 01:22:35,132 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed. [2019-10-15 01:22:35,132 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed. [2019-10-15 01:22:35,133 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2019-10-15 01:22:35,133 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2019-10-15 01:22:35,133 INFO L443 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed. [2019-10-15 01:22:35,133 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed. [2019-10-15 01:22:35,133 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed. [2019-10-15 01:22:35,133 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed. [2019-10-15 01:22:35,134 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2019-10-15 01:22:35,134 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed. [2019-10-15 01:22:35,134 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed. [2019-10-15 01:22:35,134 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed. [2019-10-15 01:22:35,134 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed. [2019-10-15 01:22:35,134 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed. [2019-10-15 01:22:35,134 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed. [2019-10-15 01:22:35,134 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed. [2019-10-15 01:22:35,135 INFO L443 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed. [2019-10-15 01:22:35,135 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed. [2019-10-15 01:22:35,135 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2019-10-15 01:22:35,135 INFO L443 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-10-15 01:22:35,135 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-10-15 01:22:35,136 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed. [2019-10-15 01:22:35,136 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed. [2019-10-15 01:22:35,136 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed. [2019-10-15 01:22:35,136 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2019-10-15 01:22:35,136 INFO L443 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2019-10-15 01:22:35,137 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed. [2019-10-15 01:22:35,137 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed. [2019-10-15 01:22:35,137 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed. [2019-10-15 01:22:35,137 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed. [2019-10-15 01:22:35,137 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2019-10-15 01:22:35,137 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed. [2019-10-15 01:22:35,138 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed. [2019-10-15 01:22:35,138 INFO L443 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-10-15 01:22:35,138 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2019-10-15 01:22:35,138 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed. [2019-10-15 01:22:35,138 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed. [2019-10-15 01:22:35,138 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-10-15 01:22:35,138 INFO L443 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2019-10-15 01:22:35,139 INFO L439 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false [2019-10-15 01:22:35,139 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2019-10-15 01:22:35,139 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-10-15 01:22:35,139 INFO L443 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed. [2019-10-15 01:22:35,139 INFO L439 ceAbstractionStarter]: At program point L24-2(lines 24 561) the Hoare annotation is: (let ((.cse0 (= main_~this_buffer_empty~0 0))) (or (and (<= main_~this_expect~0 0) (<= 0 main_~this_expect~0) .cse0 (= main_~q~0 0)) (and (<= 5 main_~q~0) (<= 0 (+ main_~P8~0 2147483648)) .cse0 (<= main_~P8~0 2147483647) (<= main_~this_expect~0 (+ (* 2 (div (+ main_~this_expect~0 (- 2)) 2)) 2))))) [2019-10-15 01:22:35,140 INFO L443 ceAbstractionStarter]: For program point L24-3(lines 24 561) no Hoare annotation was computed. [2019-10-15 01:22:35,140 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed. [2019-10-15 01:22:35,140 INFO L443 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed. [2019-10-15 01:22:35,140 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed. [2019-10-15 01:22:35,140 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed. [2019-10-15 01:22:35,141 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed. [2019-10-15 01:22:35,141 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed. [2019-10-15 01:22:35,141 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed. [2019-10-15 01:22:35,141 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed. [2019-10-15 01:22:35,141 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed. [2019-10-15 01:22:35,141 INFO L443 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed. [2019-10-15 01:22:35,142 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed. [2019-10-15 01:22:35,142 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed. [2019-10-15 01:22:35,142 INFO L443 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-10-15 01:22:35,142 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed. [2019-10-15 01:22:35,142 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed. [2019-10-15 01:22:35,143 INFO L439 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse2 (<= main_~this_expect~0 (+ (* 2 (div (+ main_~this_expect~0 (- 1)) 2)) 1))) (.cse0 (= main_~this_buffer_empty~0 1)) (.cse1 (<= 0 (+ main_~P8~0 2147483648))) (.cse4 (= main_~this_buffer_empty~0 0)) (.cse3 (<= main_~P8~0 2147483647)) (.cse5 (<= main_~this_expect~0 (+ (* 2 (div (+ main_~this_expect~0 (- 2)) 2)) 2)))) (or (and (= 4 main_~q~0) .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3 (= 3 main_~q~0)) (and .cse0 .cse1 .cse3 (= 1 main_~q~0) .cse5) (and (<= main_~this_expect~0 0) .cse4 (= main_~q~0 0) (<= 0 main_~this_expect~0)) (and (<= 5 main_~q~0) .cse1 .cse4 .cse3 .cse5))) [2019-10-15 01:22:35,143 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed. [2019-10-15 01:22:35,143 INFO L443 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed. [2019-10-15 01:22:35,143 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed. [2019-10-15 01:22:35,143 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed. [2019-10-15 01:22:35,143 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed. [2019-10-15 01:22:35,144 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed. [2019-10-15 01:22:35,144 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed. [2019-10-15 01:22:35,144 INFO L443 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed. [2019-10-15 01:22:35,144 INFO L443 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed. [2019-10-15 01:22:35,144 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed. [2019-10-15 01:22:35,144 INFO L443 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed. [2019-10-15 01:22:35,144 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed. [2019-10-15 01:22:35,145 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed. [2019-10-15 01:22:35,145 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 14 566) the Hoare annotation is: true [2019-10-15 01:22:35,145 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed. [2019-10-15 01:22:35,145 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed. [2019-10-15 01:22:35,145 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed. [2019-10-15 01:22:35,145 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2019-10-15 01:22:35,146 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2019-10-15 01:22:35,146 INFO L443 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed. [2019-10-15 01:22:35,146 INFO L443 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed. [2019-10-15 01:22:35,146 INFO L443 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed. [2019-10-15 01:22:35,146 INFO L443 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed. [2019-10-15 01:22:35,146 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-10-15 01:22:35,147 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed. [2019-10-15 01:22:35,147 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed. [2019-10-15 01:22:35,147 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-10-15 01:22:35,147 INFO L443 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2019-10-15 01:22:35,147 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed. [2019-10-15 01:22:35,148 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed. [2019-10-15 01:22:35,148 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed. [2019-10-15 01:22:35,148 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2019-10-15 01:22:35,148 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2019-10-15 01:22:35,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:22:35 BoogieIcfgContainer [2019-10-15 01:22:35,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:22:35,171 INFO L168 Benchmark]: Toolchain (without parser) took 26252.11 ms. Allocated memory was 143.1 MB in the beginning and 1.0 GB in the end (delta: 857.2 MB). Free memory was 100.3 MB in the beginning and 601.6 MB in the end (delta: -501.3 MB). Peak memory consumption was 355.9 MB. Max. memory is 7.1 GB. [2019-10-15 01:22:35,172 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 01:22:35,173 INFO L168 Benchmark]: CACSL2BoogieTranslator took 574.42 ms. Allocated memory was 143.1 MB in the beginning and 201.3 MB in the end (delta: 58.2 MB). Free memory was 100.1 MB in the beginning and 173.8 MB in the end (delta: -73.7 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-10-15 01:22:35,173 INFO L168 Benchmark]: Boogie Preprocessor took 83.65 ms. Allocated memory is still 201.3 MB. Free memory was 173.8 MB in the beginning and 170.1 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2019-10-15 01:22:35,174 INFO L168 Benchmark]: RCFGBuilder took 1028.87 ms. Allocated memory is still 201.3 MB. Free memory was 170.1 MB in the beginning and 117.0 MB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 7.1 GB. [2019-10-15 01:22:35,175 INFO L168 Benchmark]: TraceAbstraction took 24558.57 ms. Allocated memory was 201.3 MB in the beginning and 1.0 GB in the end (delta: 799.0 MB). Free memory was 117.0 MB in the beginning and 601.6 MB in the end (delta: -484.6 MB). Peak memory consumption was 314.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:22:35,179 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.22 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 574.42 ms. Allocated memory was 143.1 MB in the beginning and 201.3 MB in the end (delta: 58.2 MB). Free memory was 100.1 MB in the beginning and 173.8 MB in the end (delta: -73.7 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 83.65 ms. Allocated memory is still 201.3 MB. Free memory was 173.8 MB in the beginning and 170.1 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1028.87 ms. Allocated memory is still 201.3 MB. Free memory was 170.1 MB in the beginning and 117.0 MB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24558.57 ms. Allocated memory was 201.3 MB in the beginning and 1.0 GB in the end (delta: 799.0 MB). Free memory was 117.0 MB in the beginning and 601.6 MB in the end (delta: -484.6 MB). Peak memory consumption was 314.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: 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: 24]: Loop Invariant Derived loop invariant: (((this_expect <= 0 && 0 <= this_expect) && this_buffer_empty == 0) && q == 0) || ((((5 <= q && 0 <= P8 + 2147483648) && this_buffer_empty == 0) && P8 <= 2147483647) && this_expect <= 2 * ((this_expect + -2) / 2) + 2) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((((4 == q && this_buffer_empty == 1) && 0 <= P8 + 2147483648) && this_expect <= 2 * ((this_expect + -1) / 2) + 1) && P8 <= 2147483647) || ((((0 <= P8 + 2147483648 && this_expect <= 2 * ((this_expect + -1) / 2) + 1) && this_buffer_empty == 0) && P8 <= 2147483647) && 3 == q)) || ((((this_buffer_empty == 1 && 0 <= P8 + 2147483648) && P8 <= 2147483647) && 1 == q) && this_expect <= 2 * ((this_expect + -2) / 2) + 2)) || (((this_expect <= 0 && this_buffer_empty == 0) && q == 0) && 0 <= this_expect)) || ((((5 <= q && 0 <= P8 + 2147483648) && this_buffer_empty == 0) && P8 <= 2147483647) && this_expect <= 2 * ((this_expect + -2) / 2) + 2) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 1 error locations. Result: SAFE, OverallTime: 24.4s, OverallIterations: 12, TraceHistogramMax: 5, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 1852 SDtfs, 2118 SDslu, 2306 SDs, 0 SdLazy, 499 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=7, 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, 12 MinimizatonAttempts, 71 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 19 NumberOfFragments, 163 HoareAnnotationTreeSize, 7 FomulaSimplifications, 636 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 242 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 466 NumberOfCodeBlocks, 466 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 557 ConstructedInterpolants, 11 QuantifiedInterpolants, 164721 SizeOfPredicates, 11 NumberOfNonLiveVariables, 794 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 18 InterpolantComputations, 11 PerfectInterpolantSequences, 153/235 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...