java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-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/Problem18_label00_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:33:39,289 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:33:39,291 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:33:39,309 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:33:39,310 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:33:39,311 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:33:39,312 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:33:39,314 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:33:39,316 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:33:39,317 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:33:39,317 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:33:39,318 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:33:39,319 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:33:39,320 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:33:39,321 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:33:39,322 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:33:39,323 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:33:39,325 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:33:39,329 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:33:39,334 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:33:39,335 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:33:39,339 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:33:39,345 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:33:39,345 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:33:39,345 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:33:39,346 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:33:39,347 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:33:39,351 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:33:39,352 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:33:39,356 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:33:39,356 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:33:39,357 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:33:39,357 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:33:39,358 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:33:39,360 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:33:39,361 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:33:39,361 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:33:39,390 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:33:39,390 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:33:39,393 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:33:39,393 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:33:39,394 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:33:39,395 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:33:39,395 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:33:39,395 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:33:39,395 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:33:39,395 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:33:39,396 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:33:39,397 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:33:39,397 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:33:39,397 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:33:39,397 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:33:39,398 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:33:39,398 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:33:39,398 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:33:39,398 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:33:39,398 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:33:39,398 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:33:39,400 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:33:39,400 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:33:39,400 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:33:39,401 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:33:39,401 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:33:39,401 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:33:39,401 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:33:39,454 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:33:39,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:33:39,473 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:33:39,475 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:33:39,475 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:33:39,476 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label00_false-unreach-call.c [2018-11-06 19:33:39,545 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87396a0bb/9a61436691ea4134b312cdab945279b9/FLAG7fa3cf302 [2018-11-06 19:33:40,252 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:33:40,253 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label00_false-unreach-call.c [2018-11-06 19:33:40,278 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87396a0bb/9a61436691ea4134b312cdab945279b9/FLAG7fa3cf302 [2018-11-06 19:33:40,294 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87396a0bb/9a61436691ea4134b312cdab945279b9 [2018-11-06 19:33:40,306 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:33:40,307 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:33:40,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:33:40,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:33:40,313 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:33:40,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:33:40" (1/1) ... [2018-11-06 19:33:40,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53c7ef73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:40, skipping insertion in model container [2018-11-06 19:33:40,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:33:40" (1/1) ... [2018-11-06 19:33:40,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:33:40,474 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:33:41,604 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:33:41,609 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:33:42,122 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:33:42,150 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:33:42,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:42 WrapperNode [2018-11-06 19:33:42,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:33:42,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:33:42,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:33:42,153 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:33:42,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:42" (1/1) ... [2018-11-06 19:33:42,410 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:42" (1/1) ... [2018-11-06 19:33:42,582 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:33:42,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:33:42,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:33:42,583 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:33:42,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:42" (1/1) ... [2018-11-06 19:33:42,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:42" (1/1) ... [2018-11-06 19:33:42,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:42" (1/1) ... [2018-11-06 19:33:42,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:42" (1/1) ... [2018-11-06 19:33:42,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:42" (1/1) ... [2018-11-06 19:33:42,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:42" (1/1) ... [2018-11-06 19:33:42,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:42" (1/1) ... [2018-11-06 19:33:42,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:33:42,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:33:42,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:33:42,793 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:33:42,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:33:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:33:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:33:42,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:33:50,174 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:33:50,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:33:50 BoogieIcfgContainer [2018-11-06 19:33:50,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:33:50,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:33:50,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:33:50,180 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:33:50,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:33:40" (1/3) ... [2018-11-06 19:33:50,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48fe7d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:33:50, skipping insertion in model container [2018-11-06 19:33:50,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:33:42" (2/3) ... [2018-11-06 19:33:50,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48fe7d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:33:50, skipping insertion in model container [2018-11-06 19:33:50,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:33:50" (3/3) ... [2018-11-06 19:33:50,184 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label00_false-unreach-call.c [2018-11-06 19:33:50,195 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:33:50,206 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:33:50,224 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:33:50,267 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:33:50,268 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:33:50,268 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:33:50,269 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:33:50,269 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:33:50,269 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:33:50,269 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:33:50,269 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:33:50,269 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:33:50,304 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states. [2018-11-06 19:33:50,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-06 19:33:50,312 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:33:50,313 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] [2018-11-06 19:33:50,316 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:33:50,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:33:50,323 INFO L82 PathProgramCache]: Analyzing trace with hash 183950178, now seen corresponding path program 1 times [2018-11-06 19:33:50,327 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:33:50,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:33:50,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:33:50,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:33:50,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:33:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:33:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:33:50,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:33:50,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:33:50,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:33:50,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:33:50,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:33:50,730 INFO L87 Difference]: Start difference. First operand 758 states. Second operand 4 states. [2018-11-06 19:34:02,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:34:02,090 INFO L93 Difference]: Finished difference Result 2902 states and 5650 transitions. [2018-11-06 19:34:02,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:34:02,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-06 19:34:02,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:34:02,136 INFO L225 Difference]: With dead ends: 2902 [2018-11-06 19:34:02,136 INFO L226 Difference]: Without dead ends: 2137 [2018-11-06 19:34:02,145 INFO L604 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-11-06 19:34:02,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2018-11-06 19:34:02,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2137. [2018-11-06 19:34:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2137 states. [2018-11-06 19:34:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 3649 transitions. [2018-11-06 19:34:02,306 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 3649 transitions. Word has length 20 [2018-11-06 19:34:02,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:34:02,306 INFO L480 AbstractCegarLoop]: Abstraction has 2137 states and 3649 transitions. [2018-11-06 19:34:02,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:34:02,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3649 transitions. [2018-11-06 19:34:02,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-06 19:34:02,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:34:02,311 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 19:34:02,312 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:34:02,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:34:02,312 INFO L82 PathProgramCache]: Analyzing trace with hash -487647188, now seen corresponding path program 1 times [2018-11-06 19:34:02,313 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:34:02,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:34:02,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:02,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:34:02,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:34:02,551 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:34:02,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:34:02,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:34:02,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:34:02,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:34:02,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:34:02,557 INFO L87 Difference]: Start difference. First operand 2137 states and 3649 transitions. Second operand 4 states. [2018-11-06 19:34:09,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:34:09,441 INFO L93 Difference]: Finished difference Result 6345 states and 10882 transitions. [2018-11-06 19:34:09,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:34:09,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-11-06 19:34:09,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:34:09,465 INFO L225 Difference]: With dead ends: 6345 [2018-11-06 19:34:09,466 INFO L226 Difference]: Without dead ends: 4210 [2018-11-06 19:34:09,471 INFO L604 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-11-06 19:34:09,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4210 states. [2018-11-06 19:34:09,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4210 to 4210. [2018-11-06 19:34:09,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4210 states. [2018-11-06 19:34:09,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 6149 transitions. [2018-11-06 19:34:09,558 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 6149 transitions. Word has length 87 [2018-11-06 19:34:09,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:34:09,559 INFO L480 AbstractCegarLoop]: Abstraction has 4210 states and 6149 transitions. [2018-11-06 19:34:09,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:34:09,559 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 6149 transitions. [2018-11-06 19:34:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-06 19:34:09,563 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:34:09,563 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 19:34:09,563 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:34:09,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:34:09,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2037212259, now seen corresponding path program 1 times [2018-11-06 19:34:09,564 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:34:09,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:34:09,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:09,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:34:09,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:34:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:34:09,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:34:09,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:34:09,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:34:09,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:34:09,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:34:09,734 INFO L87 Difference]: Start difference. First operand 4210 states and 6149 transitions. Second operand 4 states. [2018-11-06 19:34:16,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:34:16,934 INFO L93 Difference]: Finished difference Result 16727 states and 24484 transitions. [2018-11-06 19:34:16,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:34:16,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-06 19:34:16,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:34:16,994 INFO L225 Difference]: With dead ends: 16727 [2018-11-06 19:34:16,994 INFO L226 Difference]: Without dead ends: 12519 [2018-11-06 19:34:17,003 INFO L604 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-11-06 19:34:17,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12519 states. [2018-11-06 19:34:17,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12519 to 12517. [2018-11-06 19:34:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12517 states. [2018-11-06 19:34:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12517 states to 12517 states and 16172 transitions. [2018-11-06 19:34:17,226 INFO L78 Accepts]: Start accepts. Automaton has 12517 states and 16172 transitions. Word has length 92 [2018-11-06 19:34:17,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:34:17,226 INFO L480 AbstractCegarLoop]: Abstraction has 12517 states and 16172 transitions. [2018-11-06 19:34:17,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:34:17,227 INFO L276 IsEmpty]: Start isEmpty. Operand 12517 states and 16172 transitions. [2018-11-06 19:34:17,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-06 19:34:17,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:34:17,229 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 19:34:17,229 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:34:17,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:34:17,230 INFO L82 PathProgramCache]: Analyzing trace with hash -75196788, now seen corresponding path program 1 times [2018-11-06 19:34:17,230 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:34:17,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:34:17,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:17,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:34:17,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:34:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:34:17,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:34:17,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:34:17,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:34:17,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:34:17,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:34:17,604 INFO L87 Difference]: Start difference. First operand 12517 states and 16172 transitions. Second operand 4 states. [2018-11-06 19:34:24,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:34:24,108 INFO L93 Difference]: Finished difference Result 47144 states and 61258 transitions. [2018-11-06 19:34:24,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:34:24,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-11-06 19:34:24,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:34:24,193 INFO L225 Difference]: With dead ends: 47144 [2018-11-06 19:34:24,193 INFO L226 Difference]: Without dead ends: 34629 [2018-11-06 19:34:24,215 INFO L604 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-11-06 19:34:24,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34629 states. [2018-11-06 19:34:24,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34629 to 34629. [2018-11-06 19:34:24,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34629 states. [2018-11-06 19:34:24,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34629 states to 34629 states and 42554 transitions. [2018-11-06 19:34:24,760 INFO L78 Accepts]: Start accepts. Automaton has 34629 states and 42554 transitions. Word has length 114 [2018-11-06 19:34:24,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:34:24,761 INFO L480 AbstractCegarLoop]: Abstraction has 34629 states and 42554 transitions. [2018-11-06 19:34:24,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:34:24,761 INFO L276 IsEmpty]: Start isEmpty. Operand 34629 states and 42554 transitions. [2018-11-06 19:34:24,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-11-06 19:34:24,774 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:34:24,774 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:34:24,775 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:34:24,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:34:24,775 INFO L82 PathProgramCache]: Analyzing trace with hash -530056706, now seen corresponding path program 1 times [2018-11-06 19:34:24,775 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:34:24,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:34:24,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:24,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:34:24,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:34:25,591 WARN L179 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-11-06 19:34:25,760 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2018-11-06 19:34:26,305 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-06 19:34:26,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:34:26,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:34:26,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:34:26,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:34:26,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:34:26,307 INFO L87 Difference]: Start difference. First operand 34629 states and 42554 transitions. Second operand 5 states. [2018-11-06 19:34:33,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:34:33,203 INFO L93 Difference]: Finished difference Result 77548 states and 94472 transitions. [2018-11-06 19:34:33,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:34:33,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 327 [2018-11-06 19:34:33,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:34:33,267 INFO L225 Difference]: With dead ends: 77548 [2018-11-06 19:34:33,267 INFO L226 Difference]: Without dead ends: 42229 [2018-11-06 19:34:33,309 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:34:33,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42229 states. [2018-11-06 19:34:33,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42229 to 41538. [2018-11-06 19:34:33,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41538 states. [2018-11-06 19:34:33,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41538 states to 41538 states and 49838 transitions. [2018-11-06 19:34:33,995 INFO L78 Accepts]: Start accepts. Automaton has 41538 states and 49838 transitions. Word has length 327 [2018-11-06 19:34:33,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:34:33,996 INFO L480 AbstractCegarLoop]: Abstraction has 41538 states and 49838 transitions. [2018-11-06 19:34:33,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:34:33,996 INFO L276 IsEmpty]: Start isEmpty. Operand 41538 states and 49838 transitions. [2018-11-06 19:34:34,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-11-06 19:34:34,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:34:34,015 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:34:34,016 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:34:34,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:34:34,017 INFO L82 PathProgramCache]: Analyzing trace with hash 697506134, now seen corresponding path program 1 times [2018-11-06 19:34:34,017 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:34:34,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:34:34,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:34,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:34:34,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:34:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 439 proven. 4 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-11-06 19:34:34,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:34:34,659 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 19:34:34,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:34:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:34:34,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:34:35,124 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 490 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-06 19:34:35,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:34:35,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 19:34:35,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:34:35,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:34:35,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:34:35,148 INFO L87 Difference]: Start difference. First operand 41538 states and 49838 transitions. Second operand 6 states. [2018-11-06 19:34:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:34:46,576 INFO L93 Difference]: Finished difference Result 107273 states and 129841 transitions. [2018-11-06 19:34:46,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 19:34:46,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 510 [2018-11-06 19:34:46,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:34:46,749 INFO L225 Difference]: With dead ends: 107273 [2018-11-06 19:34:46,750 INFO L226 Difference]: Without dead ends: 62969 [2018-11-06 19:34:46,784 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 510 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:34:46,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62969 states. [2018-11-06 19:34:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62969 to 53960. [2018-11-06 19:34:47,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53960 states. [2018-11-06 19:34:47,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53960 states to 53960 states and 60441 transitions. [2018-11-06 19:34:47,438 INFO L78 Accepts]: Start accepts. Automaton has 53960 states and 60441 transitions. Word has length 510 [2018-11-06 19:34:47,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:34:47,438 INFO L480 AbstractCegarLoop]: Abstraction has 53960 states and 60441 transitions. [2018-11-06 19:34:47,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:34:47,439 INFO L276 IsEmpty]: Start isEmpty. Operand 53960 states and 60441 transitions. [2018-11-06 19:34:47,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2018-11-06 19:34:47,452 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:34:47,453 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:34:47,453 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:34:47,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:34:47,454 INFO L82 PathProgramCache]: Analyzing trace with hash -110313669, now seen corresponding path program 1 times [2018-11-06 19:34:47,454 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:34:47,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:34:47,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:47,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:34:47,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:34:48,493 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-06 19:34:48,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:34:48,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:34:48,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:34:48,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:34:48,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:34:48,499 INFO L87 Difference]: Start difference. First operand 53960 states and 60441 transitions. Second operand 4 states. [2018-11-06 19:34:55,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:34:55,034 INFO L93 Difference]: Finished difference Result 125884 states and 141487 transitions. [2018-11-06 19:34:55,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:34:55,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 515 [2018-11-06 19:34:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:34:55,114 INFO L225 Difference]: With dead ends: 125884 [2018-11-06 19:34:55,115 INFO L226 Difference]: Without dead ends: 72617 [2018-11-06 19:34:55,151 INFO L604 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-11-06 19:34:55,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72617 states. [2018-11-06 19:34:55,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72617 to 71926. [2018-11-06 19:34:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71926 states. [2018-11-06 19:34:55,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71926 states to 71926 states and 79008 transitions. [2018-11-06 19:34:55,836 INFO L78 Accepts]: Start accepts. Automaton has 71926 states and 79008 transitions. Word has length 515 [2018-11-06 19:34:55,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:34:55,837 INFO L480 AbstractCegarLoop]: Abstraction has 71926 states and 79008 transitions. [2018-11-06 19:34:55,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:34:55,837 INFO L276 IsEmpty]: Start isEmpty. Operand 71926 states and 79008 transitions. [2018-11-06 19:34:55,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2018-11-06 19:34:55,866 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:34:55,867 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:34:55,867 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:34:55,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:34:55,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1780378265, now seen corresponding path program 1 times [2018-11-06 19:34:55,868 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:34:55,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:34:55,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:55,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:34:55,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:34:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:34:56,869 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 346 proven. 5 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-06 19:34:56,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:34:56,870 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 19:34:56,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:34:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:34:57,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:34:57,346 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-11-06 19:34:57,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:34:57,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2018-11-06 19:34:57,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:34:57,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:34:57,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:34:57,368 INFO L87 Difference]: Start difference. First operand 71926 states and 79008 transitions. Second operand 5 states. [2018-11-06 19:35:02,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:35:02,001 INFO L93 Difference]: Finished difference Result 147305 states and 161731 transitions. [2018-11-06 19:35:02,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:35:02,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 621 [2018-11-06 19:35:02,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:35:02,082 INFO L225 Difference]: With dead ends: 147305 [2018-11-06 19:35:02,082 INFO L226 Difference]: Without dead ends: 76072 [2018-11-06 19:35:02,124 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 620 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:35:02,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76072 states. [2018-11-06 19:35:03,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76072 to 76072. [2018-11-06 19:35:03,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76072 states. [2018-11-06 19:35:03,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76072 states to 76072 states and 81893 transitions. [2018-11-06 19:35:03,186 INFO L78 Accepts]: Start accepts. Automaton has 76072 states and 81893 transitions. Word has length 621 [2018-11-06 19:35:03,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:35:03,187 INFO L480 AbstractCegarLoop]: Abstraction has 76072 states and 81893 transitions. [2018-11-06 19:35:03,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:35:03,187 INFO L276 IsEmpty]: Start isEmpty. Operand 76072 states and 81893 transitions. [2018-11-06 19:35:03,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2018-11-06 19:35:03,201 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:35:03,201 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:35:03,202 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:35:03,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:35:03,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1395043914, now seen corresponding path program 1 times [2018-11-06 19:35:03,202 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:35:03,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:35:03,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:03,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:35:03,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:35:03,809 WARN L179 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 19:35:04,059 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-06 19:35:04,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:35:04,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:35:04,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:35:04,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:35:04,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:35:04,062 INFO L87 Difference]: Start difference. First operand 76072 states and 81893 transitions. Second operand 4 states. [2018-11-06 19:35:09,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:35:09,329 INFO L93 Difference]: Finished difference Result 152142 states and 163783 transitions. [2018-11-06 19:35:09,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:35:09,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 672 [2018-11-06 19:35:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:35:09,389 INFO L225 Difference]: With dead ends: 152142 [2018-11-06 19:35:09,390 INFO L226 Difference]: Without dead ends: 76763 [2018-11-06 19:35:09,427 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:35:09,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76763 states. [2018-11-06 19:35:09,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76763 to 76072. [2018-11-06 19:35:09,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76072 states. [2018-11-06 19:35:09,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76072 states to 76072 states and 80844 transitions. [2018-11-06 19:35:09,963 INFO L78 Accepts]: Start accepts. Automaton has 76072 states and 80844 transitions. Word has length 672 [2018-11-06 19:35:09,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:35:09,963 INFO L480 AbstractCegarLoop]: Abstraction has 76072 states and 80844 transitions. [2018-11-06 19:35:09,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:35:09,964 INFO L276 IsEmpty]: Start isEmpty. Operand 76072 states and 80844 transitions. [2018-11-06 19:35:10,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1322 [2018-11-06 19:35:10,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:35:10,571 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:35:10,571 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:35:10,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:35:10,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1427341471, now seen corresponding path program 1 times [2018-11-06 19:35:10,572 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:35:10,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:35:10,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:10,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:35:10,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:35:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2018-11-06 19:35:11,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:35:11,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:35:11,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:35:11,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:35:11,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:35:11,963 INFO L87 Difference]: Start difference. First operand 76072 states and 80844 transitions. Second operand 3 states. [2018-11-06 19:35:15,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:35:15,527 INFO L93 Difference]: Finished difference Result 151451 states and 160994 transitions. [2018-11-06 19:35:15,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:35:15,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1321 [2018-11-06 19:35:15,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:35:15,620 INFO L225 Difference]: With dead ends: 151451 [2018-11-06 19:35:15,620 INFO L226 Difference]: Without dead ends: 76072 [2018-11-06 19:35:15,662 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:35:15,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76072 states. [2018-11-06 19:35:16,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76072 to 76072. [2018-11-06 19:35:16,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76072 states. [2018-11-06 19:35:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76072 states to 76072 states and 79778 transitions. [2018-11-06 19:35:16,395 INFO L78 Accepts]: Start accepts. Automaton has 76072 states and 79778 transitions. Word has length 1321 [2018-11-06 19:35:16,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:35:16,398 INFO L480 AbstractCegarLoop]: Abstraction has 76072 states and 79778 transitions. [2018-11-06 19:35:16,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:35:16,398 INFO L276 IsEmpty]: Start isEmpty. Operand 76072 states and 79778 transitions. [2018-11-06 19:35:16,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1803 [2018-11-06 19:35:16,497 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:35:16,499 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:35:16,499 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:35:16,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:35:16,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1573441914, now seen corresponding path program 1 times [2018-11-06 19:35:16,501 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:35:16,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:35:16,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:16,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:35:16,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:35:17,999 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 6 [2018-11-06 19:35:21,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3034 backedges. 1369 proven. 0 refuted. 0 times theorem prover too weak. 1665 trivial. 0 not checked. [2018-11-06 19:35:21,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:35:21,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-06 19:35:21,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 19:35:21,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 19:35:21,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-06 19:35:21,323 INFO L87 Difference]: Start difference. First operand 76072 states and 79778 transitions. Second operand 8 states. [2018-11-06 19:35:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:35:32,800 INFO L93 Difference]: Finished difference Result 240387 states and 252111 transitions. [2018-11-06 19:35:32,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 19:35:32,800 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1802 [2018-11-06 19:35:32,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:35:32,964 INFO L225 Difference]: With dead ends: 240387 [2018-11-06 19:35:32,965 INFO L226 Difference]: Without dead ends: 156696 [2018-11-06 19:35:32,990 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-06 19:35:33,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156696 states. [2018-11-06 19:35:33,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156696 to 92323. [2018-11-06 19:35:33,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92323 states. [2018-11-06 19:35:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92323 states to 92323 states and 96399 transitions. [2018-11-06 19:35:33,943 INFO L78 Accepts]: Start accepts. Automaton has 92323 states and 96399 transitions. Word has length 1802 [2018-11-06 19:35:33,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:35:33,944 INFO L480 AbstractCegarLoop]: Abstraction has 92323 states and 96399 transitions. [2018-11-06 19:35:33,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 19:35:33,944 INFO L276 IsEmpty]: Start isEmpty. Operand 92323 states and 96399 transitions. [2018-11-06 19:35:34,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1804 [2018-11-06 19:35:34,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:35:34,011 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:35:34,011 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:35:34,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:35:34,012 INFO L82 PathProgramCache]: Analyzing trace with hash 308074768, now seen corresponding path program 1 times [2018-11-06 19:35:34,012 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:35:34,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:35:34,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:34,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:35:34,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:35:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:35:35,170 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 19:35:35,320 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-11-06 19:35:38,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3038 backedges. 1777 proven. 724 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2018-11-06 19:35:38,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:35:38,747 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:35:38,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:35:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:35:39,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:35:40,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3038 backedges. 1911 proven. 0 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2018-11-06 19:35:40,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:35:40,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2018-11-06 19:35:40,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 19:35:40,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 19:35:40,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-06 19:35:40,457 INFO L87 Difference]: Start difference. First operand 92323 states and 96399 transitions. Second operand 10 states. [2018-11-06 19:35:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:35:59,976 INFO L93 Difference]: Finished difference Result 314351 states and 328835 transitions. [2018-11-06 19:35:59,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-06 19:35:59,977 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1803 [2018-11-06 19:35:59,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:36:00,157 INFO L225 Difference]: With dead ends: 314351 [2018-11-06 19:36:00,158 INFO L226 Difference]: Without dead ends: 174319 [2018-11-06 19:36:00,196 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1837 GetRequests, 1815 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2018-11-06 19:36:00,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174319 states. [2018-11-06 19:36:01,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174319 to 71180. [2018-11-06 19:36:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71180 states. [2018-11-06 19:36:01,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71180 states to 71180 states and 73122 transitions. [2018-11-06 19:36:01,143 INFO L78 Accepts]: Start accepts. Automaton has 71180 states and 73122 transitions. Word has length 1803 [2018-11-06 19:36:01,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:36:01,144 INFO L480 AbstractCegarLoop]: Abstraction has 71180 states and 73122 transitions. [2018-11-06 19:36:01,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 19:36:01,144 INFO L276 IsEmpty]: Start isEmpty. Operand 71180 states and 73122 transitions. [2018-11-06 19:36:01,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1945 [2018-11-06 19:36:01,207 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:36:01,208 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:36:01,209 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:36:01,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:36:01,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1598616683, now seen corresponding path program 1 times [2018-11-06 19:36:01,210 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:36:01,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:36:01,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:01,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:36:01,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:36:04,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4169 backedges. 2475 proven. 0 refuted. 0 times theorem prover too weak. 1694 trivial. 0 not checked. [2018-11-06 19:36:04,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:36:04,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:36:04,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:36:04,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:36:04,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:36:04,615 INFO L87 Difference]: Start difference. First operand 71180 states and 73122 transitions. Second operand 4 states. [2018-11-06 19:36:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:36:08,845 INFO L93 Difference]: Finished difference Result 141667 states and 145550 transitions. [2018-11-06 19:36:08,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:36:08,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1944 [2018-11-06 19:36:08,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:36:08,907 INFO L225 Difference]: With dead ends: 141667 [2018-11-06 19:36:08,908 INFO L226 Difference]: Without dead ends: 71180 [2018-11-06 19:36:08,931 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:36:08,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71180 states. [2018-11-06 19:36:09,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71180 to 71180. [2018-11-06 19:36:09,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71180 states. [2018-11-06 19:36:09,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71180 states to 71180 states and 73004 transitions. [2018-11-06 19:36:09,460 INFO L78 Accepts]: Start accepts. Automaton has 71180 states and 73004 transitions. Word has length 1944 [2018-11-06 19:36:09,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:36:09,461 INFO L480 AbstractCegarLoop]: Abstraction has 71180 states and 73004 transitions. [2018-11-06 19:36:09,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:36:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 71180 states and 73004 transitions. [2018-11-06 19:36:09,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2006 [2018-11-06 19:36:09,524 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:36:09,526 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:36:09,526 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:36:09,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:36:09,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1902165143, now seen corresponding path program 1 times [2018-11-06 19:36:09,527 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:36:09,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:36:09,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:09,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:36:09,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:36:11,000 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 19:36:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3865 backedges. 2793 proven. 0 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2018-11-06 19:36:12,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:36:12,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:36:12,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:36:12,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:36:12,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:36:12,527 INFO L87 Difference]: Start difference. First operand 71180 states and 73004 transitions. Second operand 4 states. [2018-11-06 19:36:17,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:36:17,038 INFO L93 Difference]: Finished difference Result 156869 states and 161161 transitions. [2018-11-06 19:36:17,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:36:17,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2005 [2018-11-06 19:36:17,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:36:17,120 INFO L225 Difference]: With dead ends: 156869 [2018-11-06 19:36:17,120 INFO L226 Difference]: Without dead ends: 86382 [2018-11-06 19:36:17,151 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:36:17,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86382 states. [2018-11-06 19:36:17,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86382 to 85691. [2018-11-06 19:36:17,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85691 states. [2018-11-06 19:36:17,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85691 states to 85691 states and 87573 transitions. [2018-11-06 19:36:17,839 INFO L78 Accepts]: Start accepts. Automaton has 85691 states and 87573 transitions. Word has length 2005 [2018-11-06 19:36:17,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:36:17,840 INFO L480 AbstractCegarLoop]: Abstraction has 85691 states and 87573 transitions. [2018-11-06 19:36:17,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:36:17,840 INFO L276 IsEmpty]: Start isEmpty. Operand 85691 states and 87573 transitions. [2018-11-06 19:36:17,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2025 [2018-11-06 19:36:17,900 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:36:17,901 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:36:17,901 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:36:17,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:36:17,902 INFO L82 PathProgramCache]: Analyzing trace with hash 126684218, now seen corresponding path program 1 times [2018-11-06 19:36:17,902 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:36:17,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:36:17,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:17,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:36:17,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:36:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 2862 proven. 0 refuted. 0 times theorem prover too weak. 1603 trivial. 0 not checked. [2018-11-06 19:36:20,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:36:20,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:36:20,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:36:20,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:36:20,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:36:20,547 INFO L87 Difference]: Start difference. First operand 85691 states and 87573 transitions. Second operand 4 states. [2018-11-06 19:36:24,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:36:24,678 INFO L93 Difference]: Finished difference Result 170689 states and 174452 transitions. [2018-11-06 19:36:24,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:36:24,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2024 [2018-11-06 19:36:24,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:36:24,757 INFO L225 Difference]: With dead ends: 170689 [2018-11-06 19:36:24,757 INFO L226 Difference]: Without dead ends: 85691 [2018-11-06 19:36:24,792 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:36:24,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85691 states. [2018-11-06 19:36:25,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85691 to 85691. [2018-11-06 19:36:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85691 states. [2018-11-06 19:36:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85691 states to 85691 states and 87266 transitions. [2018-11-06 19:36:25,489 INFO L78 Accepts]: Start accepts. Automaton has 85691 states and 87266 transitions. Word has length 2024 [2018-11-06 19:36:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:36:25,490 INFO L480 AbstractCegarLoop]: Abstraction has 85691 states and 87266 transitions. [2018-11-06 19:36:25,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:36:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 85691 states and 87266 transitions. [2018-11-06 19:36:25,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2120 [2018-11-06 19:36:25,556 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:36:25,557 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:36:25,557 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:36:25,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:36:25,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1324503445, now seen corresponding path program 1 times [2018-11-06 19:36:25,558 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:36:25,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:36:25,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:25,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:36:25,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:36:30,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5146 backedges. 3147 proven. 0 refuted. 0 times theorem prover too weak. 1999 trivial. 0 not checked. [2018-11-06 19:36:30,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:36:30,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:36:30,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:36:30,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:36:30,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:36:30,152 INFO L87 Difference]: Start difference. First operand 85691 states and 87266 transitions. Second operand 3 states. [2018-11-06 19:36:33,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:36:33,104 INFO L93 Difference]: Finished difference Result 182436 states and 185855 transitions. [2018-11-06 19:36:33,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:36:33,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2119 [2018-11-06 19:36:33,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:36:33,204 INFO L225 Difference]: With dead ends: 182436 [2018-11-06 19:36:33,204 INFO L226 Difference]: Without dead ends: 96053 [2018-11-06 19:36:33,248 INFO L604 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-11-06 19:36:33,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96053 states. [2018-11-06 19:36:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96053 to 92598. [2018-11-06 19:36:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92598 states. [2018-11-06 19:36:34,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92598 states to 92598 states and 94086 transitions. [2018-11-06 19:36:34,058 INFO L78 Accepts]: Start accepts. Automaton has 92598 states and 94086 transitions. Word has length 2119 [2018-11-06 19:36:34,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:36:34,059 INFO L480 AbstractCegarLoop]: Abstraction has 92598 states and 94086 transitions. [2018-11-06 19:36:34,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:36:34,059 INFO L276 IsEmpty]: Start isEmpty. Operand 92598 states and 94086 transitions. [2018-11-06 19:36:34,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2154 [2018-11-06 19:36:34,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:36:34,127 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:36:34,127 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:36:34,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:36:34,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2096164950, now seen corresponding path program 1 times [2018-11-06 19:36:34,128 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:36:34,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:36:34,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:34,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:36:34,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:36:36,998 INFO L134 CoverageAnalysis]: Checked inductivity of 5224 backedges. 3225 proven. 0 refuted. 0 times theorem prover too weak. 1999 trivial. 0 not checked. [2018-11-06 19:36:36,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:36:36,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:36:36,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:36:37,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:36:37,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:36:37,000 INFO L87 Difference]: Start difference. First operand 92598 states and 94086 transitions. Second operand 3 states. [2018-11-06 19:36:40,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:36:40,185 INFO L93 Difference]: Finished difference Result 198323 states and 201634 transitions. [2018-11-06 19:36:40,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:36:40,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2153 [2018-11-06 19:36:40,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:36:40,290 INFO L225 Difference]: With dead ends: 198323 [2018-11-06 19:36:40,290 INFO L226 Difference]: Without dead ends: 106418 [2018-11-06 19:36:40,341 INFO L604 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-11-06 19:36:40,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106418 states. [2018-11-06 19:36:41,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106418 to 105036. [2018-11-06 19:36:41,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105036 states. [2018-11-06 19:36:41,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105036 states to 105036 states and 106750 transitions. [2018-11-06 19:36:41,170 INFO L78 Accepts]: Start accepts. Automaton has 105036 states and 106750 transitions. Word has length 2153 [2018-11-06 19:36:41,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:36:41,171 INFO L480 AbstractCegarLoop]: Abstraction has 105036 states and 106750 transitions. [2018-11-06 19:36:41,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:36:41,172 INFO L276 IsEmpty]: Start isEmpty. Operand 105036 states and 106750 transitions. [2018-11-06 19:36:41,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2198 [2018-11-06 19:36:41,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:36:41,247 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 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, 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, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:36:41,248 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:36:41,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:36:41,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1792209225, now seen corresponding path program 1 times [2018-11-06 19:36:41,248 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:36:41,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:36:41,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:41,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:36:41,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:36:44,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4754 backedges. 2414 proven. 0 refuted. 0 times theorem prover too weak. 2340 trivial. 0 not checked. [2018-11-06 19:36:44,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:36:44,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:36:44,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:36:44,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:36:44,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:36:44,131 INFO L87 Difference]: Start difference. First operand 105036 states and 106750 transitions. Second operand 4 states. [2018-11-06 19:36:48,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:36:48,460 INFO L93 Difference]: Finished difference Result 210070 states and 213499 transitions. [2018-11-06 19:36:48,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:36:48,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2197 [2018-11-06 19:36:48,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:36:48,553 INFO L225 Difference]: With dead ends: 210070 [2018-11-06 19:36:48,553 INFO L226 Difference]: Without dead ends: 105727 [2018-11-06 19:36:48,601 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:36:48,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105727 states. [2018-11-06 19:36:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105727 to 103654. [2018-11-06 19:36:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103654 states. [2018-11-06 19:36:49,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103654 states to 103654 states and 105211 transitions. [2018-11-06 19:36:49,636 INFO L78 Accepts]: Start accepts. Automaton has 103654 states and 105211 transitions. Word has length 2197 [2018-11-06 19:36:49,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:36:49,637 INFO L480 AbstractCegarLoop]: Abstraction has 103654 states and 105211 transitions. [2018-11-06 19:36:49,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:36:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand 103654 states and 105211 transitions. [2018-11-06 19:36:49,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2235 [2018-11-06 19:36:49,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:36:49,708 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:36:49,709 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:36:49,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:36:49,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1669729912, now seen corresponding path program 1 times [2018-11-06 19:36:49,710 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:36:49,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:36:49,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:49,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:36:49,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:36:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:36:50,929 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 19:36:51,204 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 10 [2018-11-06 19:36:56,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5117 backedges. 2641 proven. 1948 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-06 19:36:56,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:36:56,684 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:36:56,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:36:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:36:57,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:36:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 5117 backedges. 3455 proven. 0 refuted. 0 times theorem prover too weak. 1662 trivial. 0 not checked. [2018-11-06 19:36:59,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:36:59,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2018-11-06 19:36:59,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-06 19:36:59,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-06 19:36:59,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-06 19:36:59,389 INFO L87 Difference]: Start difference. First operand 103654 states and 105211 transitions. Second operand 12 states. [2018-11-06 19:37:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:37:13,024 INFO L93 Difference]: Finished difference Result 242206 states and 245842 transitions. [2018-11-06 19:37:13,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-06 19:37:13,025 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 2234 [2018-11-06 19:37:13,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:37:13,162 INFO L225 Difference]: With dead ends: 242206 [2018-11-06 19:37:13,162 INFO L226 Difference]: Without dead ends: 139245 [2018-11-06 19:37:13,219 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2272 GetRequests, 2245 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2018-11-06 19:37:13,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139245 states. [2018-11-06 19:37:14,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139245 to 97435. [2018-11-06 19:37:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97435 states. [2018-11-06 19:37:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97435 states to 97435 states and 98457 transitions. [2018-11-06 19:37:14,379 INFO L78 Accepts]: Start accepts. Automaton has 97435 states and 98457 transitions. Word has length 2234 [2018-11-06 19:37:14,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:37:14,380 INFO L480 AbstractCegarLoop]: Abstraction has 97435 states and 98457 transitions. [2018-11-06 19:37:14,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-06 19:37:14,380 INFO L276 IsEmpty]: Start isEmpty. Operand 97435 states and 98457 transitions. [2018-11-06 19:37:14,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2250 [2018-11-06 19:37:14,453 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:37:14,455 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:37:14,455 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:37:14,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:37:14,455 INFO L82 PathProgramCache]: Analyzing trace with hash 554132218, now seen corresponding path program 1 times [2018-11-06 19:37:14,456 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:37:14,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:37:14,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:37:14,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:37:14,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:37:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:37:17,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5509 backedges. 3751 proven. 0 refuted. 0 times theorem prover too weak. 1758 trivial. 0 not checked. [2018-11-06 19:37:17,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:37:17,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:37:17,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:37:17,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:37:17,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:37:17,861 INFO L87 Difference]: Start difference. First operand 97435 states and 98457 transitions. Second operand 4 states. [2018-11-06 19:37:22,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:37:22,762 INFO L93 Difference]: Finished difference Result 210761 states and 213011 transitions. [2018-11-06 19:37:22,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:37:22,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2249 [2018-11-06 19:37:22,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:37:22,869 INFO L225 Difference]: With dead ends: 210761 [2018-11-06 19:37:22,869 INFO L226 Difference]: Without dead ends: 114019 [2018-11-06 19:37:22,897 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-06 19:37:22,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114019 states. [2018-11-06 19:37:23,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114019 to 97435. [2018-11-06 19:37:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97435 states. [2018-11-06 19:37:23,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97435 states to 97435 states and 98324 transitions. [2018-11-06 19:37:23,873 INFO L78 Accepts]: Start accepts. Automaton has 97435 states and 98324 transitions. Word has length 2249 [2018-11-06 19:37:23,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:37:23,874 INFO L480 AbstractCegarLoop]: Abstraction has 97435 states and 98324 transitions. [2018-11-06 19:37:23,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:37:23,874 INFO L276 IsEmpty]: Start isEmpty. Operand 97435 states and 98324 transitions. [2018-11-06 19:37:23,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2259 [2018-11-06 19:37:23,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:37:23,945 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 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, 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, 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, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:37:23,945 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:37:23,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:37:23,946 INFO L82 PathProgramCache]: Analyzing trace with hash 600356299, now seen corresponding path program 1 times [2018-11-06 19:37:23,946 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:37:23,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:37:23,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:37:23,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:37:23,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:37:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:37:25,505 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 19:37:25,744 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 Received shutdown request... [2018-11-06 19:37:28,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4747 backedges. 1817 proven. 0 refuted. 0 times theorem prover too weak. 2930 trivial. 0 not checked. [2018-11-06 19:37:28,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:37:28,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:37:28,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:37:28,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:37:28,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:37:28,868 INFO L87 Difference]: Start difference. First operand 97435 states and 98324 transitions. Second operand 4 states. [2018-11-06 19:37:28,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-06 19:37:28,870 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:37:28,875 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:37:28,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:37:28 BoogieIcfgContainer [2018-11-06 19:37:28,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:37:28,876 INFO L168 Benchmark]: Toolchain (without parser) took 228569.42 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.9 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -309.2 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-06 19:37:28,876 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:37:28,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1842.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2018-11-06 19:37:28,877 INFO L168 Benchmark]: Boogie Procedure Inliner took 429.71 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 732.4 MB). Free memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: -896.4 MB). Peak memory consumption was 42.2 MB. Max. memory is 7.1 GB. [2018-11-06 19:37:28,878 INFO L168 Benchmark]: Boogie Preprocessor took 209.83 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 7.1 GB. [2018-11-06 19:37:28,879 INFO L168 Benchmark]: RCFGBuilder took 7382.50 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 538.5 MB). Peak memory consumption was 538.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:37:28,880 INFO L168 Benchmark]: TraceAbstraction took 218698.96 ms. Allocated memory was 2.2 GB in the beginning and 4.3 GB in the end (delta: 2.1 GB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -127.5 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-11-06 19:37:28,884 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1842.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 429.71 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 732.4 MB). Free memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: -896.4 MB). Peak memory consumption was 42.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 209.83 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7382.50 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 538.5 MB). Peak memory consumption was 538.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 218698.96 ms. Allocated memory was 2.2 GB in the beginning and 4.3 GB in the end (delta: 2.1 GB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -127.5 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 66). Cancelled while BasicCegarLoop was constructing difference of abstraction (97435states) and FLOYD_HOARE automaton (currently 2 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 758 locations, 1 error locations. TIMEOUT Result, 218.6s OverallTime, 21 OverallIterations, 10 TraceHistogramMax, 145.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9479 SDtfs, 49025 SDslu, 1816 SDs, 0 SdLazy, 96981 SolverSat, 16623 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 109.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5357 GetRequests, 5233 SyntacticMatches, 28 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105036occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 13.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 244591 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 21.8s InterpolantComputationTime, 32235 NumberOfCodeBlocks, 32235 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 32210 ConstructedInterpolants, 0 QuantifiedInterpolants, 117990329 SizeOfPredicates, 0 NumberOfNonLiveVariables, 6000 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 59790/62471 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown