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_label03_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 18:49:50,122 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 18:49:50,124 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 18:49:50,145 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 18:49:50,146 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 18:49:50,147 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 18:49:50,149 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 18:49:50,151 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 18:49:50,154 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 18:49:50,156 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 18:49:50,158 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 18:49:50,158 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 18:49:50,159 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 18:49:50,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 18:49:50,168 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 18:49:50,169 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 18:49:50,173 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 18:49:50,176 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 18:49:50,179 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 18:49:50,181 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 18:49:50,182 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 18:49:50,187 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 18:49:50,190 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 18:49:50,192 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 18:49:50,193 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 18:49:50,194 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 18:49:50,194 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 18:49:50,195 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 18:49:50,198 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 18:49:50,199 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 18:49:50,200 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 18:49:50,202 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 18:49:50,202 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 18:49:50,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 18:49:50,205 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 18:49:50,207 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 18:49:50,208 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:49:50,235 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 18:49:50,236 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 18:49:50,237 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 18:49:50,237 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 18:49:50,241 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 18:49:50,242 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 18:49:50,242 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 18:49:50,242 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 18:49:50,242 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 18:49:50,243 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 18:49:50,244 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 18:49:50,244 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 18:49:50,244 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 18:49:50,245 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 18:49:50,245 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 18:49:50,245 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 18:49:50,245 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 18:49:50,245 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 18:49:50,246 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 18:49:50,246 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:49:50,246 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 18:49:50,246 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 18:49:50,246 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 18:49:50,247 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 18:49:50,247 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 18:49:50,247 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 18:49:50,247 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 18:49:50,247 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 18:49:50,310 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 18:49:50,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 18:49:50,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 18:49:50,333 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 18:49:50,334 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 18:49:50,335 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label03_true-unreach-call.c [2018-10-23 18:49:50,397 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/eee5efbcd/f4381081a5e944b5a91fd51d4bee5c12/FLAG0600bab08 [2018-10-23 18:49:51,081 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 18:49:51,082 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label03_true-unreach-call.c [2018-10-23 18:49:51,102 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/eee5efbcd/f4381081a5e944b5a91fd51d4bee5c12/FLAG0600bab08 [2018-10-23 18:49:51,121 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/eee5efbcd/f4381081a5e944b5a91fd51d4bee5c12 [2018-10-23 18:49:51,131 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 18:49:51,132 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 18:49:51,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 18:49:51,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 18:49:51,138 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 18:49:51,139 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:49:51" (1/1) ... [2018-10-23 18:49:51,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4145bbd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:51, skipping insertion in model container [2018-10-23 18:49:51,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:49:51" (1/1) ... [2018-10-23 18:49:51,153 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 18:49:51,239 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 18:49:51,984 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:49:51,991 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 18:49:52,282 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:49:52,305 INFO L193 MainTranslator]: Completed translation [2018-10-23 18:49:52,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:52 WrapperNode [2018-10-23 18:49:52,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 18:49:52,307 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 18:49:52,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 18:49:52,307 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 18:49:52,319 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:49:52" (1/1) ... [2018-10-23 18:49:52,365 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:49:52" (1/1) ... [2018-10-23 18:49:52,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 18:49:52,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 18:49:52,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 18:49:52,608 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 18:49:52,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:52" (1/1) ... [2018-10-23 18:49:52,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:52" (1/1) ... [2018-10-23 18:49:52,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:52" (1/1) ... [2018-10-23 18:49:52,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:52" (1/1) ... [2018-10-23 18:49:52,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:52" (1/1) ... [2018-10-23 18:49:52,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:52" (1/1) ... [2018-10-23 18:49:52,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:52" (1/1) ... [2018-10-23 18:49:52,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 18:49:52,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 18:49:52,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 18:49:52,720 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 18:49:52,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:52" (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:49:52,785 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 18:49:52,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 18:49:52,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 18:49:58,529 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 18:49:58,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:49:58 BoogieIcfgContainer [2018-10-23 18:49:58,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 18:49:58,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 18:49:58,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 18:49:58,535 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 18:49:58,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:49:51" (1/3) ... [2018-10-23 18:49:58,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506cee0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:49:58, skipping insertion in model container [2018-10-23 18:49:58,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:52" (2/3) ... [2018-10-23 18:49:58,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506cee0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:49:58, skipping insertion in model container [2018-10-23 18:49:58,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:49:58" (3/3) ... [2018-10-23 18:49:58,539 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label03_true-unreach-call.c [2018-10-23 18:49:58,549 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 18:49:58,558 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 18:49:58,576 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 18:49:58,612 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 18:49:58,612 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 18:49:58,612 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 18:49:58,612 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 18:49:58,613 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 18:49:58,613 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 18:49:58,613 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 18:49:58,613 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 18:49:58,613 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 18:49:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-23 18:49:58,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-23 18:49:58,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:49:58,658 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] [2018-10-23 18:49:58,660 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:49:58,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:49:58,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1347359086, now seen corresponding path program 1 times [2018-10-23 18:49:58,668 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:49:58,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:49:58,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:49:58,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:49:58,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:49:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:49:59,627 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:49:59,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:49:59,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:49:59,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:49:59,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:49:59,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:49:59,655 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-23 18:50:02,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:02,760 INFO L93 Difference]: Finished difference Result 1089 states and 1954 transitions. [2018-10-23 18:50:02,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:02,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-10-23 18:50:02,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:02,791 INFO L225 Difference]: With dead ends: 1089 [2018-10-23 18:50:02,792 INFO L226 Difference]: Without dead ends: 779 [2018-10-23 18:50:02,797 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:50:02,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-10-23 18:50:02,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 515. [2018-10-23 18:50:02,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-23 18:50:02,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 887 transitions. [2018-10-23 18:50:02,886 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 887 transitions. Word has length 165 [2018-10-23 18:50:02,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:02,887 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 887 transitions. [2018-10-23 18:50:02,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:02,887 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 887 transitions. [2018-10-23 18:50:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-23 18:50:02,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:02,893 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] [2018-10-23 18:50:02,894 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:02,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:02,894 INFO L82 PathProgramCache]: Analyzing trace with hash 751655233, now seen corresponding path program 1 times [2018-10-23 18:50:02,894 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:02,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:02,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:02,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:02,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:03,278 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:50:03,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:03,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:03,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:03,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:03,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:03,284 INFO L87 Difference]: Start difference. First operand 515 states and 887 transitions. Second operand 4 states. [2018-10-23 18:50:08,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:08,453 INFO L93 Difference]: Finished difference Result 1904 states and 3379 transitions. [2018-10-23 18:50:08,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:08,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2018-10-23 18:50:08,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:08,463 INFO L225 Difference]: With dead ends: 1904 [2018-10-23 18:50:08,463 INFO L226 Difference]: Without dead ends: 1391 [2018-10-23 18:50:08,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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:50:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2018-10-23 18:50:08,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 927. [2018-10-23 18:50:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-23 18:50:08,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1521 transitions. [2018-10-23 18:50:08,501 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1521 transitions. Word has length 171 [2018-10-23 18:50:08,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:08,501 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 1521 transitions. [2018-10-23 18:50:08,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:08,502 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1521 transitions. [2018-10-23 18:50:08,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-23 18:50:08,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:08,509 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] [2018-10-23 18:50:08,509 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:08,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:08,509 INFO L82 PathProgramCache]: Analyzing trace with hash -942218426, now seen corresponding path program 1 times [2018-10-23 18:50:08,509 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:08,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:08,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:08,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:08,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:08,622 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:50:08,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:08,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:08,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:08,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:08,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:08,625 INFO L87 Difference]: Start difference. First operand 927 states and 1521 transitions. Second operand 3 states. [2018-10-23 18:50:10,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:10,434 INFO L93 Difference]: Finished difference Result 2711 states and 4483 transitions. [2018-10-23 18:50:10,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:10,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-10-23 18:50:10,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:10,445 INFO L225 Difference]: With dead ends: 2711 [2018-10-23 18:50:10,445 INFO L226 Difference]: Without dead ends: 1786 [2018-10-23 18:50:10,447 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:50:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2018-10-23 18:50:10,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1784. [2018-10-23 18:50:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2018-10-23 18:50:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2738 transitions. [2018-10-23 18:50:10,488 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2738 transitions. Word has length 172 [2018-10-23 18:50:10,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:10,488 INFO L481 AbstractCegarLoop]: Abstraction has 1784 states and 2738 transitions. [2018-10-23 18:50:10,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2738 transitions. [2018-10-23 18:50:10,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-23 18:50:10,493 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:10,493 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] [2018-10-23 18:50:10,493 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:10,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:10,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1357798669, now seen corresponding path program 1 times [2018-10-23 18:50:10,494 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:10,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:10,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:10,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:10,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:10,610 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:50:10,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:10,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:10,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:10,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:10,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:10,612 INFO L87 Difference]: Start difference. First operand 1784 states and 2738 transitions. Second operand 3 states. [2018-10-23 18:50:12,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:12,106 INFO L93 Difference]: Finished difference Result 5215 states and 8074 transitions. [2018-10-23 18:50:12,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:12,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-10-23 18:50:12,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:12,126 INFO L225 Difference]: With dead ends: 5215 [2018-10-23 18:50:12,126 INFO L226 Difference]: Without dead ends: 3433 [2018-10-23 18:50:12,130 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:50:12,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2018-10-23 18:50:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3416. [2018-10-23 18:50:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3416 states. [2018-10-23 18:50:12,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 5132 transitions. [2018-10-23 18:50:12,208 INFO L78 Accepts]: Start accepts. Automaton has 3416 states and 5132 transitions. Word has length 174 [2018-10-23 18:50:12,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:12,208 INFO L481 AbstractCegarLoop]: Abstraction has 3416 states and 5132 transitions. [2018-10-23 18:50:12,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:12,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3416 states and 5132 transitions. [2018-10-23 18:50:12,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-23 18:50:12,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:12,216 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:12,216 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:12,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:12,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1216147553, now seen corresponding path program 1 times [2018-10-23 18:50:12,217 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:12,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:12,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:12,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:12,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:12,610 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:50:12,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:12,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:12,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:12,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:12,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:12,611 INFO L87 Difference]: Start difference. First operand 3416 states and 5132 transitions. Second operand 3 states. [2018-10-23 18:50:14,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:14,483 INFO L93 Difference]: Finished difference Result 6836 states and 10274 transitions. [2018-10-23 18:50:14,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:14,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-10-23 18:50:14,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:14,507 INFO L225 Difference]: With dead ends: 6836 [2018-10-23 18:50:14,507 INFO L226 Difference]: Without dead ends: 3422 [2018-10-23 18:50:14,512 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:50:14,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3422 states. [2018-10-23 18:50:14,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3422 to 3416. [2018-10-23 18:50:14,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3416 states. [2018-10-23 18:50:14,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 4798 transitions. [2018-10-23 18:50:14,581 INFO L78 Accepts]: Start accepts. Automaton has 3416 states and 4798 transitions. Word has length 182 [2018-10-23 18:50:14,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:14,582 INFO L481 AbstractCegarLoop]: Abstraction has 3416 states and 4798 transitions. [2018-10-23 18:50:14,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:14,582 INFO L276 IsEmpty]: Start isEmpty. Operand 3416 states and 4798 transitions. [2018-10-23 18:50:14,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-23 18:50:14,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:14,592 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:14,592 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:14,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:14,592 INFO L82 PathProgramCache]: Analyzing trace with hash -50533991, now seen corresponding path program 1 times [2018-10-23 18:50:14,592 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:14,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:14,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:14,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:14,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:50:14,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:14,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:14,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:14,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:14,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:14,766 INFO L87 Difference]: Start difference. First operand 3416 states and 4798 transitions. Second operand 3 states. [2018-10-23 18:50:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:16,218 INFO L93 Difference]: Finished difference Result 10097 states and 14225 transitions. [2018-10-23 18:50:16,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:16,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-10-23 18:50:16,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:16,244 INFO L225 Difference]: With dead ends: 10097 [2018-10-23 18:50:16,245 INFO L226 Difference]: Without dead ends: 6683 [2018-10-23 18:50:16,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:50:16,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6683 states. [2018-10-23 18:50:16,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6683 to 6681. [2018-10-23 18:50:16,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6681 states. [2018-10-23 18:50:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6681 states to 6681 states and 8561 transitions. [2018-10-23 18:50:16,368 INFO L78 Accepts]: Start accepts. Automaton has 6681 states and 8561 transitions. Word has length 189 [2018-10-23 18:50:16,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:16,369 INFO L481 AbstractCegarLoop]: Abstraction has 6681 states and 8561 transitions. [2018-10-23 18:50:16,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 6681 states and 8561 transitions. [2018-10-23 18:50:16,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-23 18:50:16,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:16,379 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-23 18:50:16,380 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:16,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:16,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1485224914, now seen corresponding path program 1 times [2018-10-23 18:50:16,380 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:16,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:16,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:16,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:16,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:16,642 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 18:50:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:16,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:16,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:16,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:16,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:16,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:16,678 INFO L87 Difference]: Start difference. First operand 6681 states and 8561 transitions. Second operand 4 states. [2018-10-23 18:50:19,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:19,664 INFO L93 Difference]: Finished difference Result 26271 states and 33635 transitions. [2018-10-23 18:50:19,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:19,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2018-10-23 18:50:19,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:19,721 INFO L225 Difference]: With dead ends: 26271 [2018-10-23 18:50:19,721 INFO L226 Difference]: Without dead ends: 19592 [2018-10-23 18:50:19,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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:50:19,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19592 states. [2018-10-23 18:50:20,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19592 to 13007. [2018-10-23 18:50:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13007 states. [2018-10-23 18:50:20,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13007 states to 13007 states and 16047 transitions. [2018-10-23 18:50:20,059 INFO L78 Accepts]: Start accepts. Automaton has 13007 states and 16047 transitions. Word has length 189 [2018-10-23 18:50:20,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:20,060 INFO L481 AbstractCegarLoop]: Abstraction has 13007 states and 16047 transitions. [2018-10-23 18:50:20,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 13007 states and 16047 transitions. [2018-10-23 18:50:20,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-23 18:50:20,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:20,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:20,083 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:20,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:20,083 INFO L82 PathProgramCache]: Analyzing trace with hash -974747267, now seen corresponding path program 1 times [2018-10-23 18:50:20,084 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:20,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:20,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:20,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:20,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:20,200 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-23 18:50:20,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:20,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:20,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:20,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:20,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:20,202 INFO L87 Difference]: Start difference. First operand 13007 states and 16047 transitions. Second operand 3 states. [2018-10-23 18:50:21,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:21,122 INFO L93 Difference]: Finished difference Result 25980 states and 32049 transitions. [2018-10-23 18:50:21,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:21,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2018-10-23 18:50:21,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:21,154 INFO L225 Difference]: With dead ends: 25980 [2018-10-23 18:50:21,154 INFO L226 Difference]: Without dead ends: 12975 [2018-10-23 18:50:21,167 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:50:21,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12975 states. [2018-10-23 18:50:21,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12975 to 12975. [2018-10-23 18:50:21,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12975 states. [2018-10-23 18:50:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12975 states to 12975 states and 15735 transitions. [2018-10-23 18:50:21,321 INFO L78 Accepts]: Start accepts. Automaton has 12975 states and 15735 transitions. Word has length 227 [2018-10-23 18:50:21,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:21,321 INFO L481 AbstractCegarLoop]: Abstraction has 12975 states and 15735 transitions. [2018-10-23 18:50:21,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:21,321 INFO L276 IsEmpty]: Start isEmpty. Operand 12975 states and 15735 transitions. [2018-10-23 18:50:21,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-23 18:50:21,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:21,342 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-23 18:50:21,342 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:21,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:21,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1948082637, now seen corresponding path program 1 times [2018-10-23 18:50:21,343 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:21,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:21,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:21,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:21,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:21,562 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:21,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:21,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:21,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:21,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:21,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:21,564 INFO L87 Difference]: Start difference. First operand 12975 states and 15735 transitions. Second operand 4 states. [2018-10-23 18:50:23,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:23,450 INFO L93 Difference]: Finished difference Result 30643 states and 37689 transitions. [2018-10-23 18:50:23,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:23,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2018-10-23 18:50:23,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:23,485 INFO L225 Difference]: With dead ends: 30643 [2018-10-23 18:50:23,485 INFO L226 Difference]: Without dead ends: 17670 [2018-10-23 18:50:23,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:23,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17670 states. [2018-10-23 18:50:23,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17670 to 17667. [2018-10-23 18:50:23,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17667 states. [2018-10-23 18:50:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17667 states to 17667 states and 20516 transitions. [2018-10-23 18:50:23,703 INFO L78 Accepts]: Start accepts. Automaton has 17667 states and 20516 transitions. Word has length 230 [2018-10-23 18:50:23,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:23,704 INFO L481 AbstractCegarLoop]: Abstraction has 17667 states and 20516 transitions. [2018-10-23 18:50:23,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand 17667 states and 20516 transitions. [2018-10-23 18:50:23,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-23 18:50:23,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:23,722 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] [2018-10-23 18:50:23,723 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:23,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:23,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1958712054, now seen corresponding path program 1 times [2018-10-23 18:50:23,723 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:23,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:23,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:23,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:23,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:24,041 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:50:24,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:24,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:24,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:24,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:24,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:24,043 INFO L87 Difference]: Start difference. First operand 17667 states and 20516 transitions. Second operand 3 states. [2018-10-23 18:50:26,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:26,291 INFO L93 Difference]: Finished difference Result 34923 states and 40585 transitions. [2018-10-23 18:50:26,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:26,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2018-10-23 18:50:26,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:26,307 INFO L225 Difference]: With dead ends: 34923 [2018-10-23 18:50:26,307 INFO L226 Difference]: Without dead ends: 17258 [2018-10-23 18:50:26,321 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:50:26,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17258 states. [2018-10-23 18:50:26,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17258 to 17257. [2018-10-23 18:50:26,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17257 states. [2018-10-23 18:50:26,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17257 states to 17257 states and 19455 transitions. [2018-10-23 18:50:26,515 INFO L78 Accepts]: Start accepts. Automaton has 17257 states and 19455 transitions. Word has length 256 [2018-10-23 18:50:26,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:26,515 INFO L481 AbstractCegarLoop]: Abstraction has 17257 states and 19455 transitions. [2018-10-23 18:50:26,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:26,515 INFO L276 IsEmpty]: Start isEmpty. Operand 17257 states and 19455 transitions. [2018-10-23 18:50:26,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-23 18:50:26,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:26,532 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, 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, 1] [2018-10-23 18:50:26,533 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:26,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:26,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2046103689, now seen corresponding path program 1 times [2018-10-23 18:50:26,533 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:26,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:26,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:26,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:26,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-23 18:50:26,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:26,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:50:26,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:50:26,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:50:26,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:50:26,952 INFO L87 Difference]: Start difference. First operand 17257 states and 19455 transitions. Second operand 5 states. [2018-10-23 18:50:29,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:29,458 INFO L93 Difference]: Finished difference Result 52355 states and 58792 transitions. [2018-10-23 18:50:29,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:50:29,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 266 [2018-10-23 18:50:29,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:29,491 INFO L225 Difference]: With dead ends: 52355 [2018-10-23 18:50:29,492 INFO L226 Difference]: Without dead ends: 35100 [2018-10-23 18:50:29,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:50:29,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35100 states. [2018-10-23 18:50:29,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35100 to 35095. [2018-10-23 18:50:29,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35095 states. [2018-10-23 18:50:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35095 states to 35095 states and 39310 transitions. [2018-10-23 18:50:29,938 INFO L78 Accepts]: Start accepts. Automaton has 35095 states and 39310 transitions. Word has length 266 [2018-10-23 18:50:29,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:29,938 INFO L481 AbstractCegarLoop]: Abstraction has 35095 states and 39310 transitions. [2018-10-23 18:50:29,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:50:29,938 INFO L276 IsEmpty]: Start isEmpty. Operand 35095 states and 39310 transitions. [2018-10-23 18:50:29,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-23 18:50:29,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:29,967 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:29,967 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:29,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:29,968 INFO L82 PathProgramCache]: Analyzing trace with hash 646529718, now seen corresponding path program 1 times [2018-10-23 18:50:29,968 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:29,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:29,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:29,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:29,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-23 18:50:30,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:30,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:30,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:30,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:30,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:30,336 INFO L87 Difference]: Start difference. First operand 35095 states and 39310 transitions. Second operand 4 states. [2018-10-23 18:50:31,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:31,668 INFO L93 Difference]: Finished difference Result 69313 states and 77621 transitions. [2018-10-23 18:50:31,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:31,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2018-10-23 18:50:31,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:31,699 INFO L225 Difference]: With dead ends: 69313 [2018-10-23 18:50:31,699 INFO L226 Difference]: Without dead ends: 34220 [2018-10-23 18:50:31,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:31,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34220 states. [2018-10-23 18:50:32,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34220 to 34220. [2018-10-23 18:50:32,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34220 states. [2018-10-23 18:50:32,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34220 states to 34220 states and 37008 transitions. [2018-10-23 18:50:32,083 INFO L78 Accepts]: Start accepts. Automaton has 34220 states and 37008 transitions. Word has length 267 [2018-10-23 18:50:32,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:32,083 INFO L481 AbstractCegarLoop]: Abstraction has 34220 states and 37008 transitions. [2018-10-23 18:50:32,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:32,083 INFO L276 IsEmpty]: Start isEmpty. Operand 34220 states and 37008 transitions. [2018-10-23 18:50:32,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-23 18:50:32,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:32,094 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] [2018-10-23 18:50:32,094 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:32,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:32,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1794947131, now seen corresponding path program 1 times [2018-10-23 18:50:32,095 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:32,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:32,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:32,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:32,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:32,329 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:50:32,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:32,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:32,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:32,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:32,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:32,331 INFO L87 Difference]: Start difference. First operand 34220 states and 37008 transitions. Second operand 4 states. [2018-10-23 18:50:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:34,637 INFO L93 Difference]: Finished difference Result 120696 states and 130174 transitions. [2018-10-23 18:50:34,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:34,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 269 [2018-10-23 18:50:34,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:34,726 INFO L225 Difference]: With dead ends: 120696 [2018-10-23 18:50:34,726 INFO L226 Difference]: Without dead ends: 86478 [2018-10-23 18:50:34,757 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:50:34,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86478 states. [2018-10-23 18:50:35,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86478 to 86474. [2018-10-23 18:50:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86474 states. [2018-10-23 18:50:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86474 states to 86474 states and 93054 transitions. [2018-10-23 18:50:35,910 INFO L78 Accepts]: Start accepts. Automaton has 86474 states and 93054 transitions. Word has length 269 [2018-10-23 18:50:35,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:35,911 INFO L481 AbstractCegarLoop]: Abstraction has 86474 states and 93054 transitions. [2018-10-23 18:50:35,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:35,911 INFO L276 IsEmpty]: Start isEmpty. Operand 86474 states and 93054 transitions. [2018-10-23 18:50:35,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-23 18:50:35,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:35,920 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 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] [2018-10-23 18:50:35,921 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:35,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:35,921 INFO L82 PathProgramCache]: Analyzing trace with hash 74302533, now seen corresponding path program 1 times [2018-10-23 18:50:35,921 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:35,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:35,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:35,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:35,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:36,133 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-23 18:50:36,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:36,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:36,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:36,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:36,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:36,135 INFO L87 Difference]: Start difference. First operand 86474 states and 93054 transitions. Second operand 3 states. [2018-10-23 18:50:37,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:37,333 INFO L93 Difference]: Finished difference Result 172943 states and 186103 transitions. [2018-10-23 18:50:37,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:37,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2018-10-23 18:50:37,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:37,417 INFO L225 Difference]: With dead ends: 172943 [2018-10-23 18:50:37,417 INFO L226 Difference]: Without dead ends: 86471 [2018-10-23 18:50:37,461 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:50:37,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86471 states. [2018-10-23 18:50:38,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86471 to 86471. [2018-10-23 18:50:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86471 states. [2018-10-23 18:50:39,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86471 states to 86471 states and 93048 transitions. [2018-10-23 18:50:39,015 INFO L78 Accepts]: Start accepts. Automaton has 86471 states and 93048 transitions. Word has length 298 [2018-10-23 18:50:39,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:39,015 INFO L481 AbstractCegarLoop]: Abstraction has 86471 states and 93048 transitions. [2018-10-23 18:50:39,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:39,015 INFO L276 IsEmpty]: Start isEmpty. Operand 86471 states and 93048 transitions. [2018-10-23 18:50:39,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-23 18:50:39,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:39,026 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] [2018-10-23 18:50:39,026 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:39,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:39,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1488256468, now seen corresponding path program 1 times [2018-10-23 18:50:39,027 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:39,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:39,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:39,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:39,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:39,230 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:50:39,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:39,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:39,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:39,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:39,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:39,232 INFO L87 Difference]: Start difference. First operand 86471 states and 93048 transitions. Second operand 3 states. [2018-10-23 18:50:41,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:41,350 INFO L93 Difference]: Finished difference Result 214956 states and 231088 transitions. [2018-10-23 18:50:41,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:41,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2018-10-23 18:50:41,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:41,486 INFO L225 Difference]: With dead ends: 214956 [2018-10-23 18:50:41,486 INFO L226 Difference]: Without dead ends: 128487 [2018-10-23 18:50:41,539 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:50:41,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128487 states. [2018-10-23 18:50:43,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128487 to 125606. [2018-10-23 18:50:43,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125606 states. [2018-10-23 18:50:43,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125606 states to 125606 states and 134938 transitions. [2018-10-23 18:50:43,736 INFO L78 Accepts]: Start accepts. Automaton has 125606 states and 134938 transitions. Word has length 303 [2018-10-23 18:50:43,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:43,736 INFO L481 AbstractCegarLoop]: Abstraction has 125606 states and 134938 transitions. [2018-10-23 18:50:43,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:43,736 INFO L276 IsEmpty]: Start isEmpty. Operand 125606 states and 134938 transitions. [2018-10-23 18:50:43,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-10-23 18:50:43,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:43,753 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-23 18:50:43,753 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:43,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:43,754 INFO L82 PathProgramCache]: Analyzing trace with hash 2106864431, now seen corresponding path program 1 times [2018-10-23 18:50:43,754 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:43,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:43,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:43,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:43,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:44,965 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:44,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:50:44,965 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:50:44,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:45,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:50:45,517 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:45,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 18:50:45,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3] total 12 [2018-10-23 18:50:45,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-23 18:50:45,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-23 18:50:45,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-23 18:50:45,542 INFO L87 Difference]: Start difference. First operand 125606 states and 134938 transitions. Second operand 13 states. [2018-10-23 18:50:46,884 WARN L179 SmtUtils]: Spent 833.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 30 [2018-10-23 18:50:51,069 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-10-23 18:50:54,322 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2018-10-23 18:51:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:51:04,276 INFO L93 Difference]: Finished difference Result 557987 states and 598038 transitions. [2018-10-23 18:51:04,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-23 18:51:04,276 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 305 [2018-10-23 18:51:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:51:06,381 INFO L225 Difference]: With dead ends: 557987 [2018-10-23 18:51:06,381 INFO L226 Difference]: Without dead ends: 432383 [2018-10-23 18:51:06,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=281, Invalid=775, Unknown=0, NotChecked=0, Total=1056 [2018-10-23 18:51:06,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432383 states. [2018-10-23 18:51:13,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432383 to 410123. [2018-10-23 18:51:13,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410123 states. [2018-10-23 18:51:13,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410123 states to 410123 states and 436941 transitions. [2018-10-23 18:51:13,589 INFO L78 Accepts]: Start accepts. Automaton has 410123 states and 436941 transitions. Word has length 305 [2018-10-23 18:51:13,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:13,589 INFO L481 AbstractCegarLoop]: Abstraction has 410123 states and 436941 transitions. [2018-10-23 18:51:13,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-23 18:51:13,590 INFO L276 IsEmpty]: Start isEmpty. Operand 410123 states and 436941 transitions. [2018-10-23 18:51:13,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-10-23 18:51:13,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:13,663 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] [2018-10-23 18:51:13,664 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:13,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:13,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1554377472, now seen corresponding path program 1 times [2018-10-23 18:51:13,664 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:13,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:13,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:13,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:13,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:14,020 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-23 18:51:14,229 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:51:14,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:51:14,231 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:51:14,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:14,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:51:14,627 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:51:14,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:51:14,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-23 18:51:14,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 18:51:14,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 18:51:14,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 18:51:14,669 INFO L87 Difference]: Start difference. First operand 410123 states and 436941 transitions. Second operand 6 states. [2018-10-23 18:51:29,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:51:29,866 INFO L93 Difference]: Finished difference Result 1145138 states and 1224839 transitions. [2018-10-23 18:51:29,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-23 18:51:29,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 311 [2018-10-23 18:51:29,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:51:30,960 INFO L225 Difference]: With dead ends: 1145138 [2018-10-23 18:51:30,960 INFO L226 Difference]: Without dead ends: 735631 [2018-10-23 18:51:31,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-23 18:51:31,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735631 states. [2018-10-23 18:51:42,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735631 to 687423. [2018-10-23 18:51:42,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687423 states. [2018-10-23 18:51:42,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687423 states to 687423 states and 729815 transitions. [2018-10-23 18:51:42,879 INFO L78 Accepts]: Start accepts. Automaton has 687423 states and 729815 transitions. Word has length 311 [2018-10-23 18:51:42,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:42,879 INFO L481 AbstractCegarLoop]: Abstraction has 687423 states and 729815 transitions. [2018-10-23 18:51:42,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 18:51:42,879 INFO L276 IsEmpty]: Start isEmpty. Operand 687423 states and 729815 transitions. [2018-10-23 18:51:42,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-10-23 18:51:42,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:42,938 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 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, 4, 4, 4, 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, 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] [2018-10-23 18:51:42,938 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:42,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:42,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1662920129, now seen corresponding path program 1 times [2018-10-23 18:51:42,939 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:42,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:42,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:42,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:42,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-10-23 18:51:43,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:51:43,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:51:43,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:51:43,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:51:43,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:51:43,392 INFO L87 Difference]: Start difference. First operand 687423 states and 729815 transitions. Second operand 4 states. [2018-10-23 18:52:00,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:00,168 INFO L93 Difference]: Finished difference Result 1357273 states and 1441898 transitions. [2018-10-23 18:52:00,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:52:00,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 377 [2018-10-23 18:52:00,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:01,090 INFO L225 Difference]: With dead ends: 1357273 [2018-10-23 18:52:01,090 INFO L226 Difference]: Without dead ends: 670466 [2018-10-23 18:52:01,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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:52:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670466 states. [2018-10-23 18:52:10,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670466 to 662624. [2018-10-23 18:52:10,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662624 states. [2018-10-23 18:52:13,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662624 states to 662624 states and 702576 transitions. [2018-10-23 18:52:13,161 INFO L78 Accepts]: Start accepts. Automaton has 662624 states and 702576 transitions. Word has length 377 [2018-10-23 18:52:13,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:13,161 INFO L481 AbstractCegarLoop]: Abstraction has 662624 states and 702576 transitions. [2018-10-23 18:52:13,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:52:13,162 INFO L276 IsEmpty]: Start isEmpty. Operand 662624 states and 702576 transitions. [2018-10-23 18:52:13,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-10-23 18:52:13,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:13,247 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-10-23 18:52:13,247 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:13,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:13,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1633540290, now seen corresponding path program 2 times [2018-10-23 18:52:13,248 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:13,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:13,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:13,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:13,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-10-23 18:52:13,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:13,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:52:13,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:52:13,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:52:13,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:52:13,643 INFO L87 Difference]: Start difference. First operand 662624 states and 702576 transitions. Second operand 4 states. [2018-10-23 18:52:26,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:26,613 INFO L93 Difference]: Finished difference Result 1854870 states and 1963824 transitions. [2018-10-23 18:52:26,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:52:26,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 412 [2018-10-23 18:52:26,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:28,142 INFO L225 Difference]: With dead ends: 1854870 [2018-10-23 18:52:28,142 INFO L226 Difference]: Without dead ends: 1192248 [2018-10-23 18:52:28,370 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:52:29,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192248 states. [2018-10-23 18:52:56,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192248 to 1170534. [2018-10-23 18:52:56,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1170534 states. [2018-10-23 18:52:59,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170534 states to 1170534 states and 1238157 transitions. [2018-10-23 18:52:59,510 INFO L78 Accepts]: Start accepts. Automaton has 1170534 states and 1238157 transitions. Word has length 412 [2018-10-23 18:52:59,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:59,510 INFO L481 AbstractCegarLoop]: Abstraction has 1170534 states and 1238157 transitions. [2018-10-23 18:52:59,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:52:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1170534 states and 1238157 transitions. [2018-10-23 18:52:59,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-10-23 18:52:59,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:59,569 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, 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, 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, 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] [2018-10-23 18:52:59,569 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:59,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:59,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1247768010, now seen corresponding path program 1 times [2018-10-23 18:52:59,570 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:59,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:59,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:59,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 18:52:59,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:01,643 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-23 18:53:01,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:01,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:01,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:53:01,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:53:01,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:01,645 INFO L87 Difference]: Start difference. First operand 1170534 states and 1238157 transitions. Second operand 3 states.