java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label52_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 13:17:40,614 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 13:17:40,616 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 13:17:40,629 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 13:17:40,630 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 13:17:40,631 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 13:17:40,634 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 13:17:40,637 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 13:17:40,642 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 13:17:40,643 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 13:17:40,644 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 13:17:40,644 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 13:17:40,645 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 13:17:40,648 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 13:17:40,656 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 13:17:40,657 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 13:17:40,657 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 13:17:40,664 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 13:17:40,666 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 13:17:40,669 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 13:17:40,672 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 13:17:40,674 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 13:17:40,677 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 13:17:40,678 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 13:17:40,678 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 13:17:40,679 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 13:17:40,680 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 13:17:40,684 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 13:17:40,685 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 13:17:40,687 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 13:17:40,688 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 13:17:40,688 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 13:17:40,689 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 13:17:40,689 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 13:17:40,690 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 13:17:40,690 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 13:17:40,693 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 13:17:40,719 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 13:17:40,720 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 13:17:40,721 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 13:17:40,721 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 13:17:40,721 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 13:17:40,722 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 13:17:40,722 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 13:17:40,722 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 13:17:40,722 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 13:17:40,722 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 13:17:40,723 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 13:17:40,723 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 13:17:40,723 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 13:17:40,723 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 13:17:40,723 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 13:17:40,724 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 13:17:40,724 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 13:17:40,724 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 13:17:40,724 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 13:17:40,724 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 13:17:40,724 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 13:17:40,725 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 13:17:40,725 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 13:17:40,725 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 13:17:40,725 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 13:17:40,725 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 13:17:40,726 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 13:17:40,726 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 13:17:40,776 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 13:17:40,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 13:17:40,798 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 13:17:40,800 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 13:17:40,800 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 13:17:40,802 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label52_false-unreach-call.c [2018-10-24 13:17:40,865 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2dcab996b/f2f68d9c064c411fb7ac663291bcd7b1/FLAGf0fba899e [2018-10-24 13:17:41,553 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 13:17:41,554 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label52_false-unreach-call.c [2018-10-24 13:17:41,575 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2dcab996b/f2f68d9c064c411fb7ac663291bcd7b1/FLAGf0fba899e [2018-10-24 13:17:41,597 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2dcab996b/f2f68d9c064c411fb7ac663291bcd7b1 [2018-10-24 13:17:41,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 13:17:41,612 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 13:17:41,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 13:17:41,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 13:17:41,619 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 13:17:41,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:17:41" (1/1) ... [2018-10-24 13:17:41,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b38e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:41, skipping insertion in model container [2018-10-24 13:17:41,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:17:41" (1/1) ... [2018-10-24 13:17:41,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 13:17:41,729 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 13:17:42,477 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 13:17:42,483 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 13:17:42,725 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 13:17:42,750 INFO L193 MainTranslator]: Completed translation [2018-10-24 13:17:42,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:42 WrapperNode [2018-10-24 13:17:42,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 13:17:42,752 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 13:17:42,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 13:17:42,753 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 13:17:42,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:42" (1/1) ... [2018-10-24 13:17:42,812 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:42" (1/1) ... [2018-10-24 13:17:43,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 13:17:43,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 13:17:43,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 13:17:43,042 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 13:17:43,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:42" (1/1) ... [2018-10-24 13:17:43,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:42" (1/1) ... [2018-10-24 13:17:43,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:42" (1/1) ... [2018-10-24 13:17:43,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:42" (1/1) ... [2018-10-24 13:17:43,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:42" (1/1) ... [2018-10-24 13:17:43,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:42" (1/1) ... [2018-10-24 13:17:43,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:42" (1/1) ... [2018-10-24 13:17:43,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 13:17:43,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 13:17:43,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 13:17:43,161 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 13:17:43,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 13:17:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 13:17:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 13:17:43,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 13:17:49,091 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 13:17:49,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:17:49 BoogieIcfgContainer [2018-10-24 13:17:49,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 13:17:49,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 13:17:49,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 13:17:49,099 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 13:17:49,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:17:41" (1/3) ... [2018-10-24 13:17:49,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ae02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:17:49, skipping insertion in model container [2018-10-24 13:17:49,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:42" (2/3) ... [2018-10-24 13:17:49,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ae02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:17:49, skipping insertion in model container [2018-10-24 13:17:49,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:17:49" (3/3) ... [2018-10-24 13:17:49,103 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label52_false-unreach-call.c [2018-10-24 13:17:49,113 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 13:17:49,123 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 13:17:49,137 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 13:17:49,183 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 13:17:49,184 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 13:17:49,184 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 13:17:49,184 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 13:17:49,184 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 13:17:49,184 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 13:17:49,184 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 13:17:49,184 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 13:17:49,185 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 13:17:49,219 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 13:17:49,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-24 13:17:49,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:49,240 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:49,242 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:49,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:49,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1230754550, now seen corresponding path program 1 times [2018-10-24 13:17:49,251 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:49,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:49,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:49,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:49,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:50,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:50,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:50,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:50,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:50,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:50,215 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 13:17:53,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:53,840 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-10-24 13:17:53,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:17:53,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2018-10-24 13:17:53,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:53,948 INFO L225 Difference]: With dead ends: 1075 [2018-10-24 13:17:53,948 INFO L226 Difference]: Without dead ends: 765 [2018-10-24 13:17:53,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:53,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-10-24 13:17:54,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-10-24 13:17:54,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-24 13:17:54,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-10-24 13:17:54,089 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 147 [2018-10-24 13:17:54,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:54,090 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-10-24 13:17:54,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:17:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-10-24 13:17:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-24 13:17:54,102 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:54,102 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:54,103 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:54,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:54,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1234692011, now seen corresponding path program 1 times [2018-10-24 13:17:54,103 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:54,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:54,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:54,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:54,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:54,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:54,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:17:54,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:54,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:54,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:54,265 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-10-24 13:17:56,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:56,435 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-10-24 13:17:56,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:56,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2018-10-24 13:17:56,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:56,443 INFO L225 Difference]: With dead ends: 1465 [2018-10-24 13:17:56,443 INFO L226 Difference]: Without dead ends: 947 [2018-10-24 13:17:56,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:56,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-10-24 13:17:56,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-10-24 13:17:56,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-10-24 13:17:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-10-24 13:17:56,503 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 156 [2018-10-24 13:17:56,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:56,503 INFO L481 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-10-24 13:17:56,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:56,504 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-10-24 13:17:56,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-24 13:17:56,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:56,512 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:56,512 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:56,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:56,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1185847465, now seen corresponding path program 1 times [2018-10-24 13:17:56,513 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:56,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:56,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:56,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:56,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 13:17:56,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:56,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:56,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:56,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:56,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:56,790 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-10-24 13:17:59,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:59,102 INFO L93 Difference]: Finished difference Result 2693 states and 4423 transitions. [2018-10-24 13:17:59,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:59,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2018-10-24 13:17:59,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:59,117 INFO L225 Difference]: With dead ends: 2693 [2018-10-24 13:17:59,118 INFO L226 Difference]: Without dead ends: 1764 [2018-10-24 13:17:59,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:59,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-10-24 13:17:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1748. [2018-10-24 13:17:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1748 states. [2018-10-24 13:17:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2752 transitions. [2018-10-24 13:17:59,168 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2752 transitions. Word has length 164 [2018-10-24 13:17:59,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:59,169 INFO L481 AbstractCegarLoop]: Abstraction has 1748 states and 2752 transitions. [2018-10-24 13:17:59,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2752 transitions. [2018-10-24 13:17:59,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-24 13:17:59,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:59,174 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:59,174 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:59,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:59,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2112083193, now seen corresponding path program 1 times [2018-10-24 13:17:59,175 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:59,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:59,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:59,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:59,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 13:17:59,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:59,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:59,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:59,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:59,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:59,296 INFO L87 Difference]: Start difference. First operand 1748 states and 2752 transitions. Second operand 3 states. [2018-10-24 13:18:01,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:01,277 INFO L93 Difference]: Finished difference Result 5132 states and 8130 transitions. [2018-10-24 13:18:01,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:18:01,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2018-10-24 13:18:01,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:01,296 INFO L225 Difference]: With dead ends: 5132 [2018-10-24 13:18:01,296 INFO L226 Difference]: Without dead ends: 3386 [2018-10-24 13:18:01,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2018-10-24 13:18:01,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3385. [2018-10-24 13:18:01,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2018-10-24 13:18:01,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4962 transitions. [2018-10-24 13:18:01,376 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4962 transitions. Word has length 171 [2018-10-24 13:18:01,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:01,376 INFO L481 AbstractCegarLoop]: Abstraction has 3385 states and 4962 transitions. [2018-10-24 13:18:01,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:18:01,376 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4962 transitions. [2018-10-24 13:18:01,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-24 13:18:01,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:01,384 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:01,385 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:01,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:01,385 INFO L82 PathProgramCache]: Analyzing trace with hash -523340993, now seen corresponding path program 1 times [2018-10-24 13:18:01,385 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:01,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:01,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:01,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:01,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:01,558 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 13:18:01,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:01,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:18:01,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:18:01,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:18:01,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:01,560 INFO L87 Difference]: Start difference. First operand 3385 states and 4962 transitions. Second operand 3 states. [2018-10-24 13:18:02,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:02,976 INFO L93 Difference]: Finished difference Result 10035 states and 14750 transitions. [2018-10-24 13:18:02,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:18:02,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2018-10-24 13:18:02,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:03,003 INFO L225 Difference]: With dead ends: 10035 [2018-10-24 13:18:03,004 INFO L226 Difference]: Without dead ends: 6652 [2018-10-24 13:18:03,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:03,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6652 states. [2018-10-24 13:18:03,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6652 to 6649. [2018-10-24 13:18:03,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-10-24 13:18:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8832 transitions. [2018-10-24 13:18:03,135 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8832 transitions. Word has length 178 [2018-10-24 13:18:03,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:03,135 INFO L481 AbstractCegarLoop]: Abstraction has 6649 states and 8832 transitions. [2018-10-24 13:18:03,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:18:03,136 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8832 transitions. [2018-10-24 13:18:03,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-24 13:18:03,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:03,150 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:03,150 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:03,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:03,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1766388695, now seen corresponding path program 1 times [2018-10-24 13:18:03,151 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:03,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:03,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:03,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:03,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:03,463 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:18:03,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:03,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:18:03,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:18:03,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:18:03,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:03,465 INFO L87 Difference]: Start difference. First operand 6649 states and 8832 transitions. Second operand 4 states. [2018-10-24 13:18:05,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:05,958 INFO L93 Difference]: Finished difference Result 13297 states and 17664 transitions. [2018-10-24 13:18:05,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:18:05,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-10-24 13:18:05,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:05,981 INFO L225 Difference]: With dead ends: 13297 [2018-10-24 13:18:05,982 INFO L226 Difference]: Without dead ends: 6650 [2018-10-24 13:18:05,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:05,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6650 states. [2018-10-24 13:18:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6650 to 6649. [2018-10-24 13:18:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-10-24 13:18:06,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8345 transitions. [2018-10-24 13:18:06,119 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8345 transitions. Word has length 178 [2018-10-24 13:18:06,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:06,120 INFO L481 AbstractCegarLoop]: Abstraction has 6649 states and 8345 transitions. [2018-10-24 13:18:06,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:18:06,120 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8345 transitions. [2018-10-24 13:18:06,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-24 13:18:06,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:06,133 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 3, 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] [2018-10-24 13:18:06,133 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:06,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:06,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1489058431, now seen corresponding path program 1 times [2018-10-24 13:18:06,134 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:06,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:06,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:06,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:06,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 13:18:06,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:06,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:18:06,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:18:06,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:18:06,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:06,281 INFO L87 Difference]: Start difference. First operand 6649 states and 8345 transitions. Second operand 3 states. [2018-10-24 13:18:07,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:07,232 INFO L93 Difference]: Finished difference Result 13264 states and 16645 transitions. [2018-10-24 13:18:07,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:18:07,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2018-10-24 13:18:07,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:07,257 INFO L225 Difference]: With dead ends: 13264 [2018-10-24 13:18:07,258 INFO L226 Difference]: Without dead ends: 6617 [2018-10-24 13:18:07,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:07,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2018-10-24 13:18:07,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 6617. [2018-10-24 13:18:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6617 states. [2018-10-24 13:18:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6617 states to 6617 states and 8118 transitions. [2018-10-24 13:18:07,367 INFO L78 Accepts]: Start accepts. Automaton has 6617 states and 8118 transitions. Word has length 199 [2018-10-24 13:18:07,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:07,367 INFO L481 AbstractCegarLoop]: Abstraction has 6617 states and 8118 transitions. [2018-10-24 13:18:07,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:18:07,367 INFO L276 IsEmpty]: Start isEmpty. Operand 6617 states and 8118 transitions. [2018-10-24 13:18:07,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-24 13:18:07,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:07,379 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:07,379 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:07,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:07,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1436689474, now seen corresponding path program 1 times [2018-10-24 13:18:07,380 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:07,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:07,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:07,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:07,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:07,515 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 13:18:07,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:07,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:18:07,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:18:07,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:18:07,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:07,516 INFO L87 Difference]: Start difference. First operand 6617 states and 8118 transitions. Second operand 3 states. [2018-10-24 13:18:08,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:08,966 INFO L93 Difference]: Finished difference Result 15882 states and 19789 transitions. [2018-10-24 13:18:08,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:18:08,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2018-10-24 13:18:08,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:08,989 INFO L225 Difference]: With dead ends: 15882 [2018-10-24 13:18:08,989 INFO L226 Difference]: Without dead ends: 9267 [2018-10-24 13:18:08,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:09,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9267 states. [2018-10-24 13:18:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9267 to 9267. [2018-10-24 13:18:09,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9267 states. [2018-10-24 13:18:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9267 states to 9267 states and 10892 transitions. [2018-10-24 13:18:09,123 INFO L78 Accepts]: Start accepts. Automaton has 9267 states and 10892 transitions. Word has length 203 [2018-10-24 13:18:09,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:09,123 INFO L481 AbstractCegarLoop]: Abstraction has 9267 states and 10892 transitions. [2018-10-24 13:18:09,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:18:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 9267 states and 10892 transitions. [2018-10-24 13:18:09,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-24 13:18:09,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:09,140 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 13:18:09,140 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:09,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:09,141 INFO L82 PathProgramCache]: Analyzing trace with hash 509530604, now seen corresponding path program 1 times [2018-10-24 13:18:09,141 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:09,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:09,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:09,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:09,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:09,412 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-24 13:18:09,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:09,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:18:09,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:18:09,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:18:09,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:09,414 INFO L87 Difference]: Start difference. First operand 9267 states and 10892 transitions. Second operand 4 states. [2018-10-24 13:18:10,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:10,910 INFO L93 Difference]: Finished difference Result 26491 states and 31042 transitions. [2018-10-24 13:18:10,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:18:10,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2018-10-24 13:18:10,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:10,940 INFO L225 Difference]: With dead ends: 26491 [2018-10-24 13:18:10,941 INFO L226 Difference]: Without dead ends: 17226 [2018-10-24 13:18:10,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:10,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17226 states. [2018-10-24 13:18:11,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17226 to 17225. [2018-10-24 13:18:11,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17225 states. [2018-10-24 13:18:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17225 states to 17225 states and 19594 transitions. [2018-10-24 13:18:11,158 INFO L78 Accepts]: Start accepts. Automaton has 17225 states and 19594 transitions. Word has length 237 [2018-10-24 13:18:11,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:11,159 INFO L481 AbstractCegarLoop]: Abstraction has 17225 states and 19594 transitions. [2018-10-24 13:18:11,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:18:11,159 INFO L276 IsEmpty]: Start isEmpty. Operand 17225 states and 19594 transitions. [2018-10-24 13:18:11,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-24 13:18:11,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:11,179 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:11,179 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:11,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:11,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1908293036, now seen corresponding path program 1 times [2018-10-24 13:18:11,179 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:11,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:11,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:11,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:11,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:11,529 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-24 13:18:11,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:11,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:18:11,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:18:11,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:18:11,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:11,531 INFO L87 Difference]: Start difference. First operand 17225 states and 19594 transitions. Second operand 4 states. [2018-10-24 13:18:13,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:13,142 INFO L93 Difference]: Finished difference Result 34456 states and 39200 transitions. [2018-10-24 13:18:13,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:18:13,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2018-10-24 13:18:13,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:13,176 INFO L225 Difference]: With dead ends: 34456 [2018-10-24 13:18:13,176 INFO L226 Difference]: Without dead ends: 17233 [2018-10-24 13:18:13,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:13,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17233 states. [2018-10-24 13:18:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17233 to 17225. [2018-10-24 13:18:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17225 states. [2018-10-24 13:18:13,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17225 states to 17225 states and 19392 transitions. [2018-10-24 13:18:13,614 INFO L78 Accepts]: Start accepts. Automaton has 17225 states and 19392 transitions. Word has length 237 [2018-10-24 13:18:13,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:13,614 INFO L481 AbstractCegarLoop]: Abstraction has 17225 states and 19392 transitions. [2018-10-24 13:18:13,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:18:13,614 INFO L276 IsEmpty]: Start isEmpty. Operand 17225 states and 19392 transitions. [2018-10-24 13:18:13,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-24 13:18:13,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:13,635 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:13,635 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:13,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:13,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1920226467, now seen corresponding path program 1 times [2018-10-24 13:18:13,636 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:13,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:13,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:13,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:13,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 13:18:13,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:13,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:18:13,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:18:13,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:18:13,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:13,998 INFO L87 Difference]: Start difference. First operand 17225 states and 19392 transitions. Second operand 4 states. [2018-10-24 13:18:16,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:16,070 INFO L93 Difference]: Finished difference Result 35683 states and 40218 transitions. [2018-10-24 13:18:16,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:18:16,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2018-10-24 13:18:16,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:16,095 INFO L225 Difference]: With dead ends: 35683 [2018-10-24 13:18:16,095 INFO L226 Difference]: Without dead ends: 18460 [2018-10-24 13:18:16,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:16,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18460 states. [2018-10-24 13:18:16,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18460 to 18452. [2018-10-24 13:18:16,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18452 states. [2018-10-24 13:18:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18452 states to 18452 states and 20733 transitions. [2018-10-24 13:18:16,320 INFO L78 Accepts]: Start accepts. Automaton has 18452 states and 20733 transitions. Word has length 258 [2018-10-24 13:18:16,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:16,320 INFO L481 AbstractCegarLoop]: Abstraction has 18452 states and 20733 transitions. [2018-10-24 13:18:16,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:18:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand 18452 states and 20733 transitions. [2018-10-24 13:18:16,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-24 13:18:16,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:16,345 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 13:18:16,345 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:16,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:16,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1626643177, now seen corresponding path program 1 times [2018-10-24 13:18:16,346 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:16,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:16,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:16,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:16,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:16,544 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-10-24 13:18:16,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:16,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:18:16,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:18:16,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:18:16,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:16,546 INFO L87 Difference]: Start difference. First operand 18452 states and 20733 transitions. Second operand 3 states. [2018-10-24 13:18:18,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:18,164 INFO L93 Difference]: Finished difference Result 46744 states and 52382 transitions. [2018-10-24 13:18:18,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:18:18,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2018-10-24 13:18:18,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:18,195 INFO L225 Difference]: With dead ends: 46744 [2018-10-24 13:18:18,195 INFO L226 Difference]: Without dead ends: 28294 [2018-10-24 13:18:18,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:18,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28294 states. [2018-10-24 13:18:18,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28294 to 28290. [2018-10-24 13:18:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28290 states. [2018-10-24 13:18:18,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28290 states to 28290 states and 31586 transitions. [2018-10-24 13:18:18,568 INFO L78 Accepts]: Start accepts. Automaton has 28290 states and 31586 transitions. Word has length 264 [2018-10-24 13:18:18,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:18,569 INFO L481 AbstractCegarLoop]: Abstraction has 28290 states and 31586 transitions. [2018-10-24 13:18:18,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:18:18,569 INFO L276 IsEmpty]: Start isEmpty. Operand 28290 states and 31586 transitions. [2018-10-24 13:18:18,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-24 13:18:18,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:18,593 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:18,594 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:18,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:18,594 INFO L82 PathProgramCache]: Analyzing trace with hash 444707523, now seen corresponding path program 1 times [2018-10-24 13:18:18,594 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:18,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:18,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:18,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:18,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:19,186 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-10-24 13:18:19,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:18:19,187 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 13:18:19,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:19,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:18:19,585 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-24 13:18:19,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 13:18:19,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-24 13:18:19,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 13:18:19,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 13:18:19,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 13:18:19,620 INFO L87 Difference]: Start difference. First operand 28290 states and 31586 transitions. Second operand 6 states. [2018-10-24 13:18:26,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:26,599 INFO L93 Difference]: Finished difference Result 93858 states and 105362 transitions. [2018-10-24 13:18:26,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 13:18:26,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 272 [2018-10-24 13:18:26,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:26,682 INFO L225 Difference]: With dead ends: 93858 [2018-10-24 13:18:26,683 INFO L226 Difference]: Without dead ends: 65570 [2018-10-24 13:18:26,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-24 13:18:26,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65570 states. [2018-10-24 13:18:28,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65570 to 63317. [2018-10-24 13:18:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63317 states. [2018-10-24 13:18:28,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63317 states to 63317 states and 69195 transitions. [2018-10-24 13:18:28,136 INFO L78 Accepts]: Start accepts. Automaton has 63317 states and 69195 transitions. Word has length 272 [2018-10-24 13:18:28,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:28,137 INFO L481 AbstractCegarLoop]: Abstraction has 63317 states and 69195 transitions. [2018-10-24 13:18:28,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 13:18:28,137 INFO L276 IsEmpty]: Start isEmpty. Operand 63317 states and 69195 transitions. [2018-10-24 13:18:28,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-10-24 13:18:28,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:28,219 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-24 13:18:28,220 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:28,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:28,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1103085655, now seen corresponding path program 1 times [2018-10-24 13:18:28,220 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:28,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:28,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:28,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:28,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:28,770 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-24 13:18:28,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:28,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:18:28,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:18:28,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:18:28,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:28,772 INFO L87 Difference]: Start difference. First operand 63317 states and 69195 transitions. Second operand 4 states. [2018-10-24 13:18:31,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:31,178 INFO L93 Difference]: Finished difference Result 232583 states and 254468 transitions. [2018-10-24 13:18:31,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:18:31,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 356 [2018-10-24 13:18:31,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:31,393 INFO L225 Difference]: With dead ends: 232583 [2018-10-24 13:18:31,394 INFO L226 Difference]: Without dead ends: 169268 [2018-10-24 13:18:31,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:31,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169268 states. [2018-10-24 13:18:33,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169268 to 107588. [2018-10-24 13:18:33,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107588 states. [2018-10-24 13:18:33,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107588 states to 107588 states and 117801 transitions. [2018-10-24 13:18:33,915 INFO L78 Accepts]: Start accepts. Automaton has 107588 states and 117801 transitions. Word has length 356 [2018-10-24 13:18:33,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:33,915 INFO L481 AbstractCegarLoop]: Abstraction has 107588 states and 117801 transitions. [2018-10-24 13:18:33,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:18:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 107588 states and 117801 transitions. [2018-10-24 13:18:33,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-10-24 13:18:33,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:33,953 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 13:18:33,954 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:33,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:33,954 INFO L82 PathProgramCache]: Analyzing trace with hash 543932143, now seen corresponding path program 1 times [2018-10-24 13:18:33,954 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:33,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:33,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:33,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:33,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:34,546 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 13:18:35,342 WARN L179 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 19 [2018-10-24 13:18:36,089 WARN L179 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-10-24 13:18:36,371 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 19 [2018-10-24 13:18:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 283 proven. 128 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-24 13:18:36,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:18:36,724 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 13:18:36,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:36,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:18:37,240 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-10-24 13:18:37,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 13:18:37,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2018-10-24 13:18:37,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 13:18:37,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 13:18:37,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-24 13:18:37,265 INFO L87 Difference]: Start difference. First operand 107588 states and 117801 transitions. Second operand 10 states. [2018-10-24 13:18:37,429 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2018-10-24 13:18:39,177 WARN L179 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2018-10-24 13:18:42,211 WARN L179 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2018-10-24 13:18:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:50,842 INFO L93 Difference]: Finished difference Result 329517 states and 360909 transitions. [2018-10-24 13:18:50,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-24 13:18:50,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 370 [2018-10-24 13:18:50,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:51,093 INFO L225 Difference]: With dead ends: 329517 [2018-10-24 13:18:51,093 INFO L226 Difference]: Without dead ends: 211970 [2018-10-24 13:18:51,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 368 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2018-10-24 13:18:51,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211970 states. [2018-10-24 13:18:54,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211970 to 198751. [2018-10-24 13:18:54,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198751 states. [2018-10-24 13:18:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198751 states to 198751 states and 215924 transitions. [2018-10-24 13:18:54,604 INFO L78 Accepts]: Start accepts. Automaton has 198751 states and 215924 transitions. Word has length 370 [2018-10-24 13:18:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:54,604 INFO L481 AbstractCegarLoop]: Abstraction has 198751 states and 215924 transitions. [2018-10-24 13:18:54,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 13:18:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 198751 states and 215924 transitions. [2018-10-24 13:18:54,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-10-24 13:18:54,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:54,650 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:54,650 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:54,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:54,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1523962484, now seen corresponding path program 1 times [2018-10-24 13:18:54,651 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:54,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:54,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:54,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:54,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-24 13:18:55,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:55,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:18:55,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:18:55,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:18:55,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:55,302 INFO L87 Difference]: Start difference. First operand 198751 states and 215924 transitions. Second operand 4 states. [2018-10-24 13:19:01,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:19:01,429 INFO L93 Difference]: Finished difference Result 542357 states and 590457 transitions. [2018-10-24 13:19:01,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:19:01,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 378 [2018-10-24 13:19:01,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:19:01,854 INFO L225 Difference]: With dead ends: 542357 [2018-10-24 13:19:01,854 INFO L226 Difference]: Without dead ends: 378218 [2018-10-24 13:19:01,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:19:02,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378218 states. [2018-10-24 13:19:14,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378218 to 378009. [2018-10-24 13:19:14,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378009 states. [2018-10-24 13:19:15,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378009 states to 378009 states and 410604 transitions. [2018-10-24 13:19:15,273 INFO L78 Accepts]: Start accepts. Automaton has 378009 states and 410604 transitions. Word has length 378 [2018-10-24 13:19:15,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:19:15,273 INFO L481 AbstractCegarLoop]: Abstraction has 378009 states and 410604 transitions. [2018-10-24 13:19:15,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:19:15,273 INFO L276 IsEmpty]: Start isEmpty. Operand 378009 states and 410604 transitions. [2018-10-24 13:19:15,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-10-24 13:19:15,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:19:15,319 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:19:15,319 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:19:15,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:19:15,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1391412688, now seen corresponding path program 1 times [2018-10-24 13:19:15,319 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:19:15,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:19:15,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:15,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:19:15,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:19:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 13:19:15,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:19:15,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:19:15,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:19:15,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:19:15,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:19:15,855 INFO L87 Difference]: Start difference. First operand 378009 states and 410604 transitions. Second operand 4 states. [2018-10-24 13:19:21,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:19:21,848 INFO L93 Difference]: Finished difference Result 924963 states and 1004993 transitions. [2018-10-24 13:19:21,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:19:21,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 380 [2018-10-24 13:19:21,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:19:22,535 INFO L225 Difference]: With dead ends: 924963 [2018-10-24 13:19:22,535 INFO L226 Difference]: Without dead ends: 546956 [2018-10-24 13:19:22,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:19:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546956 states. [2018-10-24 13:19:31,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546956 to 531174. [2018-10-24 13:19:31,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531174 states. [2018-10-24 13:19:32,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531174 states to 531174 states and 571799 transitions. [2018-10-24 13:19:32,080 INFO L78 Accepts]: Start accepts. Automaton has 531174 states and 571799 transitions. Word has length 380 [2018-10-24 13:19:32,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:19:32,081 INFO L481 AbstractCegarLoop]: Abstraction has 531174 states and 571799 transitions. [2018-10-24 13:19:32,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:19:32,081 INFO L276 IsEmpty]: Start isEmpty. Operand 531174 states and 571799 transitions. [2018-10-24 13:19:32,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-10-24 13:19:32,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:19:32,151 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:19:32,151 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:19:32,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:19:32,152 INFO L82 PathProgramCache]: Analyzing trace with hash 877687789, now seen corresponding path program 1 times [2018-10-24 13:19:32,152 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:19:32,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:19:32,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:32,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:19:32,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:19:32,707 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 13:19:32,925 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-24 13:19:33,189 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 13:19:33,381 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 13:19:33,693 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-24 13:19:34,124 WARN L179 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-10-24 13:19:34,597 WARN L179 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2018-10-24 13:19:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 346 proven. 29 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-24 13:19:36,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:19:36,349 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 13:19:36,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:19:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:19:36,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:19:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 265 proven. 124 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-24 13:19:36,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 13:19:36,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 11 [2018-10-24 13:19:36,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 13:19:36,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 13:19:36,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-10-24 13:19:36,745 INFO L87 Difference]: Start difference. First operand 531174 states and 571799 transitions. Second operand 12 states. [2018-10-24 13:20:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:20:14,440 INFO L93 Difference]: Finished difference Result 3351086 states and 3606369 transitions. [2018-10-24 13:20:14,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-24 13:20:14,440 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 415 [2018-10-24 13:20:14,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:20:18,555 INFO L225 Difference]: With dead ends: 3351086 [2018-10-24 13:20:18,555 INFO L226 Difference]: Without dead ends: 2819898 [2018-10-24 13:20:18,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 413 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=413, Invalid=1147, Unknown=0, NotChecked=0, Total=1560 [2018-10-24 13:20:22,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819898 states. Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown