java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label29_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 18:53:33,529 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 18:53:33,531 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 18:53:33,547 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 18:53:33,547 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 18:53:33,551 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 18:53:33,552 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 18:53:33,556 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 18:53:33,558 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 18:53:33,559 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 18:53:33,563 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 18:53:33,563 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 18:53:33,564 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 18:53:33,567 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 18:53:33,570 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 18:53:33,571 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 18:53:33,572 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 18:53:33,574 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 18:53:33,576 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 18:53:33,578 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 18:53:33,579 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 18:53:33,580 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 18:53:33,583 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 18:53:33,583 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 18:53:33,583 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 18:53:33,584 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 18:53:33,585 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 18:53:33,586 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 18:53:33,587 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 18:53:33,588 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 18:53:33,588 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 18:53:33,589 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 18:53:33,589 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 18:53:33,590 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 18:53:33,591 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 18:53:33,591 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 18:53:33,592 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 18:53:33,608 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 18:53:33,608 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 18:53:33,609 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 18:53:33,609 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 18:53:33,611 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 18:53:33,611 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 18:53:33,611 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 18:53:33,613 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 18:53:33,613 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 18:53:33,613 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 18:53:33,613 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 18:53:33,613 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 18:53:33,614 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 18:53:33,614 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 18:53:33,614 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 18:53:33,614 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 18:53:33,614 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 18:53:33,615 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 18:53:33,615 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 18:53:33,616 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:53:33,616 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 18:53:33,616 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 18:53:33,616 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 18:53:33,616 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 18:53:33,616 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 18:53:33,617 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 18:53:33,617 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 18:53:33,617 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 18:53:33,677 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 18:53:33,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 18:53:33,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 18:53:33,696 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 18:53:33,697 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 18:53:33,697 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label29_true-unreach-call.c [2018-10-23 18:53:33,763 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/02499f4ff/683ec30e7bea4a86b7917b86742c79c5/FLAG30c7a157b [2018-10-23 18:53:34,464 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 18:53:34,465 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label29_true-unreach-call.c [2018-10-23 18:53:34,482 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/02499f4ff/683ec30e7bea4a86b7917b86742c79c5/FLAG30c7a157b [2018-10-23 18:53:34,498 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/02499f4ff/683ec30e7bea4a86b7917b86742c79c5 [2018-10-23 18:53:34,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 18:53:34,511 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 18:53:34,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 18:53:34,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 18:53:34,516 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 18:53:34,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:53:34" (1/1) ... [2018-10-23 18:53:34,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f2d59c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:34, skipping insertion in model container [2018-10-23 18:53:34,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:53:34" (1/1) ... [2018-10-23 18:53:34,532 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 18:53:34,632 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 18:53:35,393 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:53:35,398 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 18:53:35,631 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:53:35,653 INFO L193 MainTranslator]: Completed translation [2018-10-23 18:53:35,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:35 WrapperNode [2018-10-23 18:53:35,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 18:53:35,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 18:53:35,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 18:53:35,655 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 18:53:35,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:35" (1/1) ... [2018-10-23 18:53:35,702 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:35" (1/1) ... [2018-10-23 18:53:35,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 18:53:35,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 18:53:35,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 18:53:35,941 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 18:53:35,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:35" (1/1) ... [2018-10-23 18:53:35,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:35" (1/1) ... [2018-10-23 18:53:35,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:35" (1/1) ... [2018-10-23 18:53:35,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:35" (1/1) ... [2018-10-23 18:53:36,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:35" (1/1) ... [2018-10-23 18:53:36,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:35" (1/1) ... [2018-10-23 18:53:36,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:35" (1/1) ... [2018-10-23 18:53:36,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 18:53:36,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 18:53:36,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 18:53:36,072 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 18:53:36,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:53:36,149 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 18:53:36,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 18:53:36,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 18:53:41,540 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 18:53:41,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:53:41 BoogieIcfgContainer [2018-10-23 18:53:41,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 18:53:41,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 18:53:41,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 18:53:41,548 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 18:53:41,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:53:34" (1/3) ... [2018-10-23 18:53:41,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eed3607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:53:41, skipping insertion in model container [2018-10-23 18:53:41,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:35" (2/3) ... [2018-10-23 18:53:41,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eed3607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:53:41, skipping insertion in model container [2018-10-23 18:53:41,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:53:41" (3/3) ... [2018-10-23 18:53:41,552 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label29_true-unreach-call.c [2018-10-23 18:53:41,564 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 18:53:41,573 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 18:53:41,591 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 18:53:41,631 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 18:53:41,632 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 18:53:41,632 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 18:53:41,633 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 18:53:41,633 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 18:53:41,633 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 18:53:41,633 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 18:53:41,633 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 18:53:41,633 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 18:53:41,671 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-23 18:53:41,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-23 18:53:41,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:41,690 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:41,693 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:41,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:41,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1558585738, now seen corresponding path program 1 times [2018-10-23 18:53:41,700 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:41,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:41,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:41,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:41,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:42,598 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 18:53:42,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:42,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:42,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:42,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:53:42,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:53:42,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:42,729 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-23 18:53:46,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:46,692 INFO L93 Difference]: Finished difference Result 1089 states and 1954 transitions. [2018-10-23 18:53:46,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:53:46,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-10-23 18:53:46,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:46,724 INFO L225 Difference]: With dead ends: 1089 [2018-10-23 18:53:46,724 INFO L226 Difference]: Without dead ends: 779 [2018-10-23 18:53:46,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:46,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-10-23 18:53:46,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 515. [2018-10-23 18:53:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-23 18:53:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 887 transitions. [2018-10-23 18:53:46,820 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 887 transitions. Word has length 179 [2018-10-23 18:53:46,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:46,821 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 887 transitions. [2018-10-23 18:53:46,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:53:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 887 transitions. [2018-10-23 18:53:46,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-23 18:53:46,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:46,828 INFO L375 BasicCegarLoop]: trace histogram [2, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:46,829 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:46,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:46,829 INFO L82 PathProgramCache]: Analyzing trace with hash -86535, now seen corresponding path program 1 times [2018-10-23 18:53:46,830 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:46,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:46,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:46,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:46,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:47,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:47,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:47,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:47,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:53:47,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:53:47,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:47,195 INFO L87 Difference]: Start difference. First operand 515 states and 887 transitions. Second operand 4 states. [2018-10-23 18:53:51,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:51,724 INFO L93 Difference]: Finished difference Result 1904 states and 3379 transitions. [2018-10-23 18:53:51,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:53:51,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-10-23 18:53:51,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:51,733 INFO L225 Difference]: With dead ends: 1904 [2018-10-23 18:53:51,733 INFO L226 Difference]: Without dead ends: 1391 [2018-10-23 18:53:51,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:51,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2018-10-23 18:53:51,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 927. [2018-10-23 18:53:51,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-23 18:53:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1521 transitions. [2018-10-23 18:53:51,803 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1521 transitions. Word has length 185 [2018-10-23 18:53:51,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:51,803 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 1521 transitions. [2018-10-23 18:53:51,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:53:51,804 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1521 transitions. [2018-10-23 18:53:51,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-23 18:53:51,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:51,810 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:51,810 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:51,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:51,811 INFO L82 PathProgramCache]: Analyzing trace with hash 534235966, now seen corresponding path program 1 times [2018-10-23 18:53:51,811 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:51,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:51,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:51,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:51,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:51,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:51,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:53:51,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:53:51,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:53:51,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:51,935 INFO L87 Difference]: Start difference. First operand 927 states and 1521 transitions. Second operand 3 states. [2018-10-23 18:53:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:53,704 INFO L93 Difference]: Finished difference Result 2712 states and 4483 transitions. [2018-10-23 18:53:53,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:53:53,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2018-10-23 18:53:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:53,714 INFO L225 Difference]: With dead ends: 2712 [2018-10-23 18:53:53,715 INFO L226 Difference]: Without dead ends: 1787 [2018-10-23 18:53:53,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:53,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-10-23 18:53:53,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1783. [2018-10-23 18:53:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1783 states. [2018-10-23 18:53:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2737 transitions. [2018-10-23 18:53:53,754 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2737 transitions. Word has length 186 [2018-10-23 18:53:53,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:53,754 INFO L481 AbstractCegarLoop]: Abstraction has 1783 states and 2737 transitions. [2018-10-23 18:53:53,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:53:53,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2737 transitions. [2018-10-23 18:53:53,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-23 18:53:53,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:53,760 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:53,760 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:53,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:53,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1193220139, now seen corresponding path program 1 times [2018-10-23 18:53:53,761 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:53,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:53,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:53,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:53,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:53,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:53,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:53,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:53:53,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:53:53,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:53:53,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:53,878 INFO L87 Difference]: Start difference. First operand 1783 states and 2737 transitions. Second operand 3 states. [2018-10-23 18:53:55,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:55,551 INFO L93 Difference]: Finished difference Result 5213 states and 8072 transitions. [2018-10-23 18:53:55,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:53:55,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-10-23 18:53:55,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:55,571 INFO L225 Difference]: With dead ends: 5213 [2018-10-23 18:53:55,572 INFO L226 Difference]: Without dead ends: 3432 [2018-10-23 18:53:55,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:55,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2018-10-23 18:53:55,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 3415. [2018-10-23 18:53:55,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3415 states. [2018-10-23 18:53:55,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 5131 transitions. [2018-10-23 18:53:55,709 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 5131 transitions. Word has length 188 [2018-10-23 18:53:55,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:55,709 INFO L481 AbstractCegarLoop]: Abstraction has 3415 states and 5131 transitions. [2018-10-23 18:53:55,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:53:55,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 5131 transitions. [2018-10-23 18:53:55,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-23 18:53:55,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:55,717 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:55,718 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:55,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:55,718 INFO L82 PathProgramCache]: Analyzing trace with hash -280439908, now seen corresponding path program 1 times [2018-10-23 18:53:55,718 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:55,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:55,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:55,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:55,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:56,003 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:56,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:56,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:56,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:53:56,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:53:56,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:56,005 INFO L87 Difference]: Start difference. First operand 3415 states and 5131 transitions. Second operand 4 states. [2018-10-23 18:53:58,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:58,445 INFO L93 Difference]: Finished difference Result 13155 states and 19899 transitions. [2018-10-23 18:53:58,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:53:58,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-10-23 18:53:58,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:58,486 INFO L225 Difference]: With dead ends: 13155 [2018-10-23 18:53:58,486 INFO L226 Difference]: Without dead ends: 9742 [2018-10-23 18:53:58,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:58,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9742 states. [2018-10-23 18:53:58,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9742 to 9740. [2018-10-23 18:53:58,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9740 states. [2018-10-23 18:53:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9740 states to 9740 states and 12804 transitions. [2018-10-23 18:53:58,677 INFO L78 Accepts]: Start accepts. Automaton has 9740 states and 12804 transitions. Word has length 199 [2018-10-23 18:53:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:58,678 INFO L481 AbstractCegarLoop]: Abstraction has 9740 states and 12804 transitions. [2018-10-23 18:53:58,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:53:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 9740 states and 12804 transitions. [2018-10-23 18:53:58,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-23 18:53:58,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:58,699 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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] [2018-10-23 18:53:58,700 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:58,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:58,700 INFO L82 PathProgramCache]: Analyzing trace with hash 693271054, now seen corresponding path program 1 times [2018-10-23 18:53:58,700 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:58,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:58,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:58,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:58,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:59,166 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-23 18:53:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:59,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:59,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:53:59,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:53:59,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:53:59,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:53:59,201 INFO L87 Difference]: Start difference. First operand 9740 states and 12804 transitions. Second operand 5 states. [2018-10-23 18:54:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:02,629 INFO L93 Difference]: Finished difference Result 33361 states and 43963 transitions. [2018-10-23 18:54:02,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:54:02,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2018-10-23 18:54:02,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:02,701 INFO L225 Difference]: With dead ends: 33361 [2018-10-23 18:54:02,701 INFO L226 Difference]: Without dead ends: 23623 [2018-10-23 18:54:02,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:54:02,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23623 states. [2018-10-23 18:54:03,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23623 to 19867. [2018-10-23 18:54:03,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19867 states. [2018-10-23 18:54:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19867 states to 19867 states and 25791 transitions. [2018-10-23 18:54:03,273 INFO L78 Accepts]: Start accepts. Automaton has 19867 states and 25791 transitions. Word has length 219 [2018-10-23 18:54:03,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:03,274 INFO L481 AbstractCegarLoop]: Abstraction has 19867 states and 25791 transitions. [2018-10-23 18:54:03,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:54:03,274 INFO L276 IsEmpty]: Start isEmpty. Operand 19867 states and 25791 transitions. [2018-10-23 18:54:03,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-23 18:54:03,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:03,312 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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, 1, 1, 1, 1, 1] [2018-10-23 18:54:03,312 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:03,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:03,313 INFO L82 PathProgramCache]: Analyzing trace with hash -233162514, now seen corresponding path program 1 times [2018-10-23 18:54:03,313 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:03,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:03,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:03,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:03,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:03,493 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-23 18:54:03,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:03,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:54:03,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:54:03,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:54:03,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:54:03,496 INFO L87 Difference]: Start difference. First operand 19867 states and 25791 transitions. Second operand 3 states. [2018-10-23 18:54:04,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:04,795 INFO L93 Difference]: Finished difference Result 39073 states and 50587 transitions. [2018-10-23 18:54:04,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:54:04,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2018-10-23 18:54:04,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:04,841 INFO L225 Difference]: With dead ends: 39073 [2018-10-23 18:54:04,842 INFO L226 Difference]: Without dead ends: 19208 [2018-10-23 18:54:04,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:54:04,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19208 states. [2018-10-23 18:54:05,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19208 to 19208. [2018-10-23 18:54:05,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19208 states. [2018-10-23 18:54:05,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19208 states to 19208 states and 24265 transitions. [2018-10-23 18:54:05,152 INFO L78 Accepts]: Start accepts. Automaton has 19208 states and 24265 transitions. Word has length 244 [2018-10-23 18:54:05,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:05,152 INFO L481 AbstractCegarLoop]: Abstraction has 19208 states and 24265 transitions. [2018-10-23 18:54:05,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:54:05,152 INFO L276 IsEmpty]: Start isEmpty. Operand 19208 states and 24265 transitions. [2018-10-23 18:54:05,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-23 18:54:05,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:05,176 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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] [2018-10-23 18:54:05,176 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:05,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:05,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1395890500, now seen corresponding path program 1 times [2018-10-23 18:54:05,177 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:05,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:05,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:05,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:05,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:54:05,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:05,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:54:05,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:54:05,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:54:05,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:05,542 INFO L87 Difference]: Start difference. First operand 19208 states and 24265 transitions. Second operand 4 states. [2018-10-23 18:54:07,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:07,004 INFO L93 Difference]: Finished difference Result 38350 states and 48460 transitions. [2018-10-23 18:54:07,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:54:07,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2018-10-23 18:54:07,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:07,036 INFO L225 Difference]: With dead ends: 38350 [2018-10-23 18:54:07,036 INFO L226 Difference]: Without dead ends: 19144 [2018-10-23 18:54:07,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:07,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19144 states. [2018-10-23 18:54:07,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19144 to 19144. [2018-10-23 18:54:07,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19144 states. [2018-10-23 18:54:07,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19144 states to 19144 states and 22596 transitions. [2018-10-23 18:54:07,298 INFO L78 Accepts]: Start accepts. Automaton has 19144 states and 22596 transitions. Word has length 270 [2018-10-23 18:54:07,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:07,299 INFO L481 AbstractCegarLoop]: Abstraction has 19144 states and 22596 transitions. [2018-10-23 18:54:07,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:54:07,299 INFO L276 IsEmpty]: Start isEmpty. Operand 19144 states and 22596 transitions. [2018-10-23 18:54:07,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-23 18:54:07,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:07,321 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:54:07,322 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:07,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:07,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1302232778, now seen corresponding path program 1 times [2018-10-23 18:54:07,322 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:07,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:07,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:07,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:07,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:07,789 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:54:07,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:07,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:54:07,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:54:07,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:54:07,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:07,790 INFO L87 Difference]: Start difference. First operand 19144 states and 22596 transitions. Second operand 4 states. [2018-10-23 18:54:09,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:09,454 INFO L93 Difference]: Finished difference Result 56812 states and 66932 transitions. [2018-10-23 18:54:09,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:54:09,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 282 [2018-10-23 18:54:09,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:09,499 INFO L225 Difference]: With dead ends: 56812 [2018-10-23 18:54:09,499 INFO L226 Difference]: Without dead ends: 37670 [2018-10-23 18:54:09,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:09,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37670 states. [2018-10-23 18:54:09,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37670 to 37668. [2018-10-23 18:54:09,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37668 states. [2018-10-23 18:54:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37668 states to 37668 states and 44294 transitions. [2018-10-23 18:54:09,989 INFO L78 Accepts]: Start accepts. Automaton has 37668 states and 44294 transitions. Word has length 282 [2018-10-23 18:54:09,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:09,989 INFO L481 AbstractCegarLoop]: Abstraction has 37668 states and 44294 transitions. [2018-10-23 18:54:09,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:54:09,989 INFO L276 IsEmpty]: Start isEmpty. Operand 37668 states and 44294 transitions. [2018-10-23 18:54:10,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-10-23 18:54:10,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:10,006 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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] [2018-10-23 18:54:10,007 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:10,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:10,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1963981493, now seen corresponding path program 1 times [2018-10-23 18:54:10,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:10,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:10,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:10,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:10,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-23 18:54:10,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:10,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:54:10,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:54:10,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:54:10,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:10,403 INFO L87 Difference]: Start difference. First operand 37668 states and 44294 transitions. Second operand 4 states. [2018-10-23 18:54:13,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:13,711 INFO L93 Difference]: Finished difference Result 149002 states and 174885 transitions. [2018-10-23 18:54:13,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:54:13,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 283 [2018-10-23 18:54:13,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:13,821 INFO L225 Difference]: With dead ends: 149002 [2018-10-23 18:54:13,821 INFO L226 Difference]: Without dead ends: 111336 [2018-10-23 18:54:13,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111336 states. [2018-10-23 18:54:14,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111336 to 92807. [2018-10-23 18:54:14,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92807 states. [2018-10-23 18:54:14,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92807 states to 92807 states and 108696 transitions. [2018-10-23 18:54:14,960 INFO L78 Accepts]: Start accepts. Automaton has 92807 states and 108696 transitions. Word has length 283 [2018-10-23 18:54:14,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:14,960 INFO L481 AbstractCegarLoop]: Abstraction has 92807 states and 108696 transitions. [2018-10-23 18:54:14,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:54:14,960 INFO L276 IsEmpty]: Start isEmpty. Operand 92807 states and 108696 transitions. [2018-10-23 18:54:14,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-10-23 18:54:14,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:14,974 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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] [2018-10-23 18:54:14,974 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:14,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:14,974 INFO L82 PathProgramCache]: Analyzing trace with hash -522758865, now seen corresponding path program 1 times [2018-10-23 18:54:14,975 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:14,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:14,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:14,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:14,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 111 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-23 18:54:15,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:54:15,256 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:54:15,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:15,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:54:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-23 18:54:15,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:54:15,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2018-10-23 18:54:15,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:54:15,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:54:15,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:54:15,555 INFO L87 Difference]: Start difference. First operand 92807 states and 108696 transitions. Second operand 5 states. [2018-10-23 18:54:20,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:20,091 INFO L93 Difference]: Finished difference Result 618265 states and 722483 transitions. [2018-10-23 18:54:20,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 18:54:20,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 291 [2018-10-23 18:54:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:20,786 INFO L225 Difference]: With dead ends: 618265 [2018-10-23 18:54:20,786 INFO L226 Difference]: Without dead ends: 525460 [2018-10-23 18:54:20,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-23 18:54:21,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525460 states. [2018-10-23 18:54:26,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525460 to 351464. [2018-10-23 18:54:26,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351464 states. [2018-10-23 18:54:27,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351464 states to 351464 states and 410348 transitions. [2018-10-23 18:54:27,332 INFO L78 Accepts]: Start accepts. Automaton has 351464 states and 410348 transitions. Word has length 291 [2018-10-23 18:54:27,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:27,333 INFO L481 AbstractCegarLoop]: Abstraction has 351464 states and 410348 transitions. [2018-10-23 18:54:27,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:54:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 351464 states and 410348 transitions. [2018-10-23 18:54:27,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-10-23 18:54:27,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:27,351 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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] [2018-10-23 18:54:27,352 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:27,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:27,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1983100851, now seen corresponding path program 1 times [2018-10-23 18:54:27,352 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:27,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:27,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:27,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:27,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-23 18:54:27,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:27,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:54:27,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:54:27,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:54:27,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:54:27,511 INFO L87 Difference]: Start difference. First operand 351464 states and 410348 transitions. Second operand 3 states. [2018-10-23 18:54:30,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:30,685 INFO L93 Difference]: Finished difference Result 693760 states and 809918 transitions. [2018-10-23 18:54:30,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:54:30,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2018-10-23 18:54:30,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:39,912 INFO L225 Difference]: With dead ends: 693760 [2018-10-23 18:54:39,912 INFO L226 Difference]: Without dead ends: 342298 [2018-10-23 18:54:40,051 INFO L605 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 [2018-10-23 18:54:40,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342298 states. [2018-10-23 18:54:43,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342298 to 335627. [2018-10-23 18:54:43,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335627 states. [2018-10-23 18:54:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335627 states to 335627 states and 379986 transitions. [2018-10-23 18:54:43,940 INFO L78 Accepts]: Start accepts. Automaton has 335627 states and 379986 transitions. Word has length 305 [2018-10-23 18:54:43,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:43,940 INFO L481 AbstractCegarLoop]: Abstraction has 335627 states and 379986 transitions. [2018-10-23 18:54:43,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:54:43,940 INFO L276 IsEmpty]: Start isEmpty. Operand 335627 states and 379986 transitions. [2018-10-23 18:54:43,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-10-23 18:54:43,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:43,960 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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] [2018-10-23 18:54:43,960 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:43,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:43,961 INFO L82 PathProgramCache]: Analyzing trace with hash 968461030, now seen corresponding path program 1 times [2018-10-23 18:54:43,961 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:43,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:43,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:43,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:43,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:44,179 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-23 18:54:44,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:44,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:54:44,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:54:44,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:54:44,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:54:44,181 INFO L87 Difference]: Start difference. First operand 335627 states and 379986 transitions. Second operand 3 states. [2018-10-23 18:54:49,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:49,401 INFO L93 Difference]: Finished difference Result 839543 states and 950224 transitions. [2018-10-23 18:54:49,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:54:49,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2018-10-23 18:54:49,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:50,112 INFO L225 Difference]: With dead ends: 839543 [2018-10-23 18:54:50,113 INFO L226 Difference]: Without dead ends: 503918 [2018-10-23 18:54:50,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:54:50,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503918 states. [2018-10-23 18:54:58,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503918 to 503898. [2018-10-23 18:54:58,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503898 states. [2018-10-23 18:54:59,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503898 states to 503898 states and 569727 transitions. [2018-10-23 18:54:59,116 INFO L78 Accepts]: Start accepts. Automaton has 503898 states and 569727 transitions. Word has length 317 [2018-10-23 18:54:59,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:59,116 INFO L481 AbstractCegarLoop]: Abstraction has 503898 states and 569727 transitions. [2018-10-23 18:54:59,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:54:59,116 INFO L276 IsEmpty]: Start isEmpty. Operand 503898 states and 569727 transitions. [2018-10-23 18:54:59,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-10-23 18:54:59,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:59,154 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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] [2018-10-23 18:54:59,154 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:59,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:59,155 INFO L82 PathProgramCache]: Analyzing trace with hash -879595334, now seen corresponding path program 1 times [2018-10-23 18:54:59,155 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:59,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:59,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:59,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:59,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:59,395 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-23 18:54:59,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:54:59,396 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:54:59,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:59,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:54:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-10-23 18:54:59,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:54:59,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-23 18:54:59,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 18:54:59,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 18:54:59,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 18:54:59,744 INFO L87 Difference]: Start difference. First operand 503898 states and 569727 transitions. Second operand 6 states. [2018-10-23 18:55:21,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:21,196 INFO L93 Difference]: Finished difference Result 1984010 states and 2220734 transitions. [2018-10-23 18:55:21,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-23 18:55:21,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 325 [2018-10-23 18:55:21,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:23,256 INFO L225 Difference]: With dead ends: 1984010 [2018-10-23 18:55:23,256 INFO L226 Difference]: Without dead ends: 1480114 [2018-10-23 18:55:25,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-23 18:55:26,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480114 states. [2018-10-23 18:55:44,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480114 to 1463460. [2018-10-23 18:55:44,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1463460 states. [2018-10-23 18:56:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463460 states to 1463460 states and 1611127 transitions. [2018-10-23 18:56:10,282 INFO L78 Accepts]: Start accepts. Automaton has 1463460 states and 1611127 transitions. Word has length 325 [2018-10-23 18:56:10,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:56:10,282 INFO L481 AbstractCegarLoop]: Abstraction has 1463460 states and 1611127 transitions. [2018-10-23 18:56:10,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 18:56:10,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1463460 states and 1611127 transitions. [2018-10-23 18:56:10,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-10-23 18:56:10,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:56:10,332 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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] [2018-10-23 18:56:10,333 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:56:10,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:56:10,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1429019348, now seen corresponding path program 1 times [2018-10-23 18:56:10,333 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:56:10,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:56:10,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:10,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:10,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:10,889 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-23 18:56:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-23 18:56:11,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:56:11,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:56:11,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:56:11,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:56:11,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:56:11,071 INFO L87 Difference]: Start difference. First operand 1463460 states and 1611127 transitions. Second operand 5 states. Received shutdown request... [2018-10-23 18:56:43,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:56:43,993 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 18:56:43,999 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 18:56:44,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:56:43 BoogieIcfgContainer [2018-10-23 18:56:44,000 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 18:56:44,001 INFO L168 Benchmark]: Toolchain (without parser) took 189490.87 ms. Allocated memory was 1.5 GB in the beginning and 7.1 GB in the end (delta: 5.6 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.1 GB). Peak memory consumption was 4.3 GB. Max. memory is 7.1 GB. [2018-10-23 18:56:44,002 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 18:56:44,002 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1142.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-23 18:56:44,003 INFO L168 Benchmark]: Boogie Procedure Inliner took 285.42 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 733.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -855.8 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-23 18:56:44,004 INFO L168 Benchmark]: Boogie Preprocessor took 130.85 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. [2018-10-23 18:56:44,005 INFO L168 Benchmark]: RCFGBuilder took 5469.29 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 248.7 MB). Peak memory consumption was 248.7 MB. Max. memory is 7.1 GB. [2018-10-23 18:56:44,006 INFO L168 Benchmark]: TraceAbstraction took 182457.81 ms. Allocated memory was 2.2 GB in the beginning and 7.1 GB in the end (delta: 4.9 GB). Free memory was 1.9 GB in the beginning and 3.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 4.0 GB. Max. memory is 7.1 GB. [2018-10-23 18:56:44,011 INFO L336 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 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1142.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 285.42 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 733.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -855.8 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.85 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5469.29 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 248.7 MB). Peak memory consumption was 248.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 182457.81 ms. Allocated memory was 2.2 GB in the beginning and 7.1 GB in the end (delta: 4.9 GB). Free memory was 1.9 GB in the beginning and 3.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 4.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1569]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1569). Cancelled while BasicCegarLoop was constructing difference of abstraction (1463460states) and FLOYD_HOARE automaton (currently 5 states, 5 states before enhancement),while ReachableStatesComputation was computing reachable states (2985916 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 182.3s OverallTime, 15 OverallIterations, 5 TraceHistogramMax, 108.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3106 SDtfs, 13149 SDslu, 3463 SDs, 0 SdLazy, 15416 SolverSat, 3511 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 668 GetRequests, 628 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1463460occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 67.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 220379 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 4414 NumberOfCodeBlocks, 4414 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 4397 ConstructedInterpolants, 0 QuantifiedInterpolants, 2285733 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1065 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 2006/2015 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown