java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label20_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:55:58,127 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:55:58,129 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:55:58,141 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:55:58,142 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:55:58,143 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:55:58,144 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:55:58,146 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:55:58,147 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:55:58,148 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:55:58,149 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:55:58,150 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:55:58,151 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:55:58,152 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:55:58,153 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:55:58,154 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:55:58,155 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:55:58,157 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:55:58,161 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:55:58,162 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:55:58,166 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:55:58,168 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:55:58,171 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:55:58,171 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:55:58,171 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:55:58,172 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:55:58,174 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:55:58,174 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:55:58,177 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:55:58,178 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:55:58,178 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:55:58,179 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:55:58,179 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:55:58,180 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:55:58,182 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:55:58,185 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:55:58,186 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:55:58,209 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:55:58,210 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:55:58,210 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:55:58,211 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:55:58,211 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:55:58,211 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:55:58,212 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:55:58,212 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:55:58,212 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:55:58,212 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:55:58,213 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:55:58,213 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:55:58,213 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:55:58,213 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:55:58,213 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:55:58,213 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:55:58,214 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:55:58,214 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:55:58,214 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:55:58,214 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:55:58,215 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:55:58,215 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:55:58,215 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:55:58,215 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:55:58,215 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:55:58,215 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:55:58,216 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:55:58,216 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:55:58,278 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:55:58,292 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:55:58,296 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:55:58,298 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:55:58,298 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:55:58,299 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label20_true-unreach-call.c [2018-11-06 19:55:58,370 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccc7aa074/3feba2c4fc9f44c692f0e52dff58b241/FLAG3243ed42d [2018-11-06 19:55:59,097 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:55:59,098 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label20_true-unreach-call.c [2018-11-06 19:55:59,122 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccc7aa074/3feba2c4fc9f44c692f0e52dff58b241/FLAG3243ed42d [2018-11-06 19:55:59,136 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccc7aa074/3feba2c4fc9f44c692f0e52dff58b241 [2018-11-06 19:55:59,146 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:55:59,148 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:55:59,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:55:59,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:55:59,153 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:55:59,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:55:59" (1/1) ... [2018-11-06 19:55:59,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d73b804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:59, skipping insertion in model container [2018-11-06 19:55:59,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:55:59" (1/1) ... [2018-11-06 19:55:59,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:55:59,254 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:55:59,962 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:55:59,969 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:56:00,246 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:56:00,272 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:56:00,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:00 WrapperNode [2018-11-06 19:56:00,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:56:00,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:56:00,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:56:00,274 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:56:00,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:00" (1/1) ... [2018-11-06 19:56:00,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:00" (1/1) ... [2018-11-06 19:56:00,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:56:00,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:56:00,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:56:00,590 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:56:00,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:00" (1/1) ... [2018-11-06 19:56:00,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:00" (1/1) ... [2018-11-06 19:56:00,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:00" (1/1) ... [2018-11-06 19:56:00,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:00" (1/1) ... [2018-11-06 19:56:00,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:00" (1/1) ... [2018-11-06 19:56:00,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:00" (1/1) ... [2018-11-06 19:56:00,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:00" (1/1) ... [2018-11-06 19:56:00,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:56:00,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:56:00,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:56:00,734 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:56:00,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:56:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:56:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:56:00,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:56:06,237 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:56:06,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:56:06 BoogieIcfgContainer [2018-11-06 19:56:06,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:56:06,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:56:06,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:56:06,242 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:56:06,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:55:59" (1/3) ... [2018-11-06 19:56:06,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64758d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:56:06, skipping insertion in model container [2018-11-06 19:56:06,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:00" (2/3) ... [2018-11-06 19:56:06,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64758d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:56:06, skipping insertion in model container [2018-11-06 19:56:06,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:56:06" (3/3) ... [2018-11-06 19:56:06,246 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label20_true-unreach-call.c [2018-11-06 19:56:06,256 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:56:06,264 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:56:06,282 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:56:06,320 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:56:06,321 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:56:06,321 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:56:06,321 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:56:06,322 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:56:06,322 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:56:06,322 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:56:06,322 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:56:06,322 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:56:06,350 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-11-06 19:56:06,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-06 19:56:06,369 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:06,370 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:06,373 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:06,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:06,380 INFO L82 PathProgramCache]: Analyzing trace with hash -2132905468, now seen corresponding path program 1 times [2018-11-06 19:56:06,381 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:06,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:06,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:06,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:06,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:07,241 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:56:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:56:07,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:07,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:07,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:56:07,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:56:07,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:07,384 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-11-06 19:56:10,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:10,852 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-11-06 19:56:10,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:56:10,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2018-11-06 19:56:10,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:10,881 INFO L225 Difference]: With dead ends: 1075 [2018-11-06 19:56:10,881 INFO L226 Difference]: Without dead ends: 765 [2018-11-06 19:56:10,886 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:10,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-11-06 19:56:10,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-11-06 19:56:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-11-06 19:56:10,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-11-06 19:56:10,985 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 196 [2018-11-06 19:56:10,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:10,987 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-11-06 19:56:10,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:56:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-11-06 19:56:11,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-06 19:56:11,001 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:11,002 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:11,002 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:11,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:11,003 INFO L82 PathProgramCache]: Analyzing trace with hash 481259907, now seen corresponding path program 1 times [2018-11-06 19:56:11,003 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:11,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:11,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:11,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:11,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:56:11,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:11,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:56:11,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:11,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:11,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:11,187 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-11-06 19:56:13,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:13,539 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-11-06 19:56:13,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:13,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-11-06 19:56:13,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:13,546 INFO L225 Difference]: With dead ends: 1465 [2018-11-06 19:56:13,547 INFO L226 Difference]: Without dead ends: 947 [2018-11-06 19:56:13,550 INFO L604 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-11-06 19:56:13,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-11-06 19:56:13,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-11-06 19:56:13,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-11-06 19:56:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-11-06 19:56:13,592 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 205 [2018-11-06 19:56:13,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:13,593 INFO L480 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-11-06 19:56:13,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:13,593 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-11-06 19:56:13,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-06 19:56:13,597 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:13,597 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:13,598 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:13,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:13,598 INFO L82 PathProgramCache]: Analyzing trace with hash 561737559, now seen corresponding path program 1 times [2018-11-06 19:56:13,598 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:13,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:13,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:13,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:13,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:13,863 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:56:13,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:13,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:13,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:13,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:13,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:13,866 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-11-06 19:56:18,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:18,706 INFO L93 Difference]: Finished difference Result 2683 states and 4400 transitions. [2018-11-06 19:56:18,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:18,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-11-06 19:56:18,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:18,718 INFO L225 Difference]: With dead ends: 2683 [2018-11-06 19:56:18,719 INFO L226 Difference]: Without dead ends: 1754 [2018-11-06 19:56:18,721 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:18,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2018-11-06 19:56:18,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1753. [2018-11-06 19:56:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2018-11-06 19:56:18,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2648 transitions. [2018-11-06 19:56:18,760 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2648 transitions. Word has length 213 [2018-11-06 19:56:18,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:18,761 INFO L480 AbstractCegarLoop]: Abstraction has 1753 states and 2648 transitions. [2018-11-06 19:56:18,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:18,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2648 transitions. [2018-11-06 19:56:18,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-06 19:56:18,767 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:18,767 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:18,767 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:18,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:18,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1378145821, now seen corresponding path program 1 times [2018-11-06 19:56:18,768 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:18,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:18,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:18,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:18,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:18,916 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:56:18,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:18,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:18,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:18,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:18,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:18,918 INFO L87 Difference]: Start difference. First operand 1753 states and 2648 transitions. Second operand 3 states. [2018-11-06 19:56:20,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:20,508 INFO L93 Difference]: Finished difference Result 5139 states and 7808 transitions. [2018-11-06 19:56:20,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:20,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-11-06 19:56:20,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:20,527 INFO L225 Difference]: With dead ends: 5139 [2018-11-06 19:56:20,527 INFO L226 Difference]: Without dead ends: 3388 [2018-11-06 19:56:20,531 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:20,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2018-11-06 19:56:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3385. [2018-11-06 19:56:20,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2018-11-06 19:56:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4616 transitions. [2018-11-06 19:56:20,652 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4616 transitions. Word has length 220 [2018-11-06 19:56:20,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:20,653 INFO L480 AbstractCegarLoop]: Abstraction has 3385 states and 4616 transitions. [2018-11-06 19:56:20,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:20,653 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4616 transitions. [2018-11-06 19:56:20,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-06 19:56:20,663 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:20,663 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:20,663 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:20,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:20,664 INFO L82 PathProgramCache]: Analyzing trace with hash 864161103, now seen corresponding path program 1 times [2018-11-06 19:56:20,664 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:20,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:20,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:20,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:20,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:20,960 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:56:20,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:20,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:20,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:56:20,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:56:20,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:20,962 INFO L87 Difference]: Start difference. First operand 3385 states and 4616 transitions. Second operand 4 states. [2018-11-06 19:56:23,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:23,747 INFO L93 Difference]: Finished difference Result 13365 states and 18287 transitions. [2018-11-06 19:56:23,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:56:23,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2018-11-06 19:56:23,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:23,791 INFO L225 Difference]: With dead ends: 13365 [2018-11-06 19:56:23,792 INFO L226 Difference]: Without dead ends: 9982 [2018-11-06 19:56:23,799 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:23,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9982 states. [2018-11-06 19:56:23,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9982 to 6649. [2018-11-06 19:56:23,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-11-06 19:56:23,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8879 transitions. [2018-11-06 19:56:23,939 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8879 transitions. Word has length 223 [2018-11-06 19:56:23,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:23,939 INFO L480 AbstractCegarLoop]: Abstraction has 6649 states and 8879 transitions. [2018-11-06 19:56:23,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:56:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8879 transitions. [2018-11-06 19:56:23,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-06 19:56:23,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:23,955 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:23,955 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:23,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:23,956 INFO L82 PathProgramCache]: Analyzing trace with hash 190389150, now seen corresponding path program 1 times [2018-11-06 19:56:23,956 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:23,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:23,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:23,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:23,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:24,192 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:56:24,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:24,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:24,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:56:24,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:56:24,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:24,194 INFO L87 Difference]: Start difference. First operand 6649 states and 8879 transitions. Second operand 4 states. [2018-11-06 19:56:25,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:25,976 INFO L93 Difference]: Finished difference Result 16563 states and 22621 transitions. [2018-11-06 19:56:25,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:56:25,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2018-11-06 19:56:25,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:26,014 INFO L225 Difference]: With dead ends: 16563 [2018-11-06 19:56:26,014 INFO L226 Difference]: Without dead ends: 9916 [2018-11-06 19:56:26,025 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:26,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9916 states. [2018-11-06 19:56:26,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9916 to 9913. [2018-11-06 19:56:26,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9913 states. [2018-11-06 19:56:26,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9913 states to 9913 states and 12603 transitions. [2018-11-06 19:56:26,192 INFO L78 Accepts]: Start accepts. Automaton has 9913 states and 12603 transitions. Word has length 224 [2018-11-06 19:56:26,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:26,192 INFO L480 AbstractCegarLoop]: Abstraction has 9913 states and 12603 transitions. [2018-11-06 19:56:26,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:56:26,193 INFO L276 IsEmpty]: Start isEmpty. Operand 9913 states and 12603 transitions. [2018-11-06 19:56:26,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-06 19:56:26,211 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:26,211 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:26,211 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:26,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:26,212 INFO L82 PathProgramCache]: Analyzing trace with hash -2062478070, now seen corresponding path program 1 times [2018-11-06 19:56:26,212 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:26,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:26,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:26,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:26,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:26,368 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:56:26,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:26,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:56:26,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:26,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:26,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:26,370 INFO L87 Difference]: Start difference. First operand 9913 states and 12603 transitions. Second operand 3 states. [2018-11-06 19:56:28,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:28,089 INFO L93 Difference]: Finished difference Result 24787 states and 31363 transitions. [2018-11-06 19:56:28,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:28,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2018-11-06 19:56:28,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:28,121 INFO L225 Difference]: With dead ends: 24787 [2018-11-06 19:56:28,122 INFO L226 Difference]: Without dead ends: 14876 [2018-11-06 19:56:28,135 INFO L604 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-11-06 19:56:28,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14876 states. [2018-11-06 19:56:28,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14876 to 14871. [2018-11-06 19:56:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14871 states. [2018-11-06 19:56:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14871 states to 14871 states and 18725 transitions. [2018-11-06 19:56:28,358 INFO L78 Accepts]: Start accepts. Automaton has 14871 states and 18725 transitions. Word has length 225 [2018-11-06 19:56:28,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:28,359 INFO L480 AbstractCegarLoop]: Abstraction has 14871 states and 18725 transitions. [2018-11-06 19:56:28,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:28,359 INFO L276 IsEmpty]: Start isEmpty. Operand 14871 states and 18725 transitions. [2018-11-06 19:56:28,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-06 19:56:28,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:28,387 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:28,387 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:28,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:28,388 INFO L82 PathProgramCache]: Analyzing trace with hash -811081506, now seen corresponding path program 1 times [2018-11-06 19:56:28,388 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:28,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:28,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:28,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:28,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:56:28,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:56:28,725 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:56:28,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:28,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:56:29,052 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:56:29,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:56:29,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 19:56:29,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:56:29,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:56:29,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:56:29,088 INFO L87 Difference]: Start difference. First operand 14871 states and 18725 transitions. Second operand 6 states. [2018-11-06 19:56:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:35,358 INFO L93 Difference]: Finished difference Result 72482 states and 90983 transitions. [2018-11-06 19:56:35,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 19:56:35,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 233 [2018-11-06 19:56:35,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:35,478 INFO L225 Difference]: With dead ends: 72482 [2018-11-06 19:56:35,479 INFO L226 Difference]: Without dead ends: 57613 [2018-11-06 19:56:35,513 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 236 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-11-06 19:56:35,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57613 states. [2018-11-06 19:56:36,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57613 to 57322. [2018-11-06 19:56:36,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57322 states. [2018-11-06 19:56:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57322 states to 57322 states and 67495 transitions. [2018-11-06 19:56:36,364 INFO L78 Accepts]: Start accepts. Automaton has 57322 states and 67495 transitions. Word has length 233 [2018-11-06 19:56:36,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:36,364 INFO L480 AbstractCegarLoop]: Abstraction has 57322 states and 67495 transitions. [2018-11-06 19:56:36,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:56:36,364 INFO L276 IsEmpty]: Start isEmpty. Operand 57322 states and 67495 transitions. [2018-11-06 19:56:36,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-11-06 19:56:36,447 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:36,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:36,448 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:36,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:36,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1878846867, now seen corresponding path program 1 times [2018-11-06 19:56:36,449 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:36,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:36,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:36,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:36,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-06 19:56:36,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:36,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:56:36,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:36,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:36,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:36,640 INFO L87 Difference]: Start difference. First operand 57322 states and 67495 transitions. Second operand 3 states. [2018-11-06 19:56:38,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:38,991 INFO L93 Difference]: Finished difference Result 113324 states and 133252 transitions. [2018-11-06 19:56:38,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:38,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2018-11-06 19:56:38,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:39,095 INFO L225 Difference]: With dead ends: 113324 [2018-11-06 19:56:39,095 INFO L226 Difference]: Without dead ends: 56004 [2018-11-06 19:56:39,159 INFO L604 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-11-06 19:56:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56004 states. [2018-11-06 19:56:40,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56004 to 56004. [2018-11-06 19:56:40,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56004 states. [2018-11-06 19:56:40,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56004 states to 56004 states and 64260 transitions. [2018-11-06 19:56:40,204 INFO L78 Accepts]: Start accepts. Automaton has 56004 states and 64260 transitions. Word has length 248 [2018-11-06 19:56:40,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:40,204 INFO L480 AbstractCegarLoop]: Abstraction has 56004 states and 64260 transitions. [2018-11-06 19:56:40,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:40,204 INFO L276 IsEmpty]: Start isEmpty. Operand 56004 states and 64260 transitions. [2018-11-06 19:56:40,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-11-06 19:56:40,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:40,234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:40,234 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:40,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:40,234 INFO L82 PathProgramCache]: Analyzing trace with hash 714838033, now seen corresponding path program 1 times [2018-11-06 19:56:40,235 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:40,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:40,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:40,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:40,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:40,473 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:56:40,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:40,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:40,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:56:40,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:56:40,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:40,475 INFO L87 Difference]: Start difference. First operand 56004 states and 64260 transitions. Second operand 4 states. [2018-11-06 19:56:43,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:43,265 INFO L93 Difference]: Finished difference Result 126724 states and 145678 transitions. [2018-11-06 19:56:43,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:56:43,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 307 [2018-11-06 19:56:43,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:43,375 INFO L225 Difference]: With dead ends: 126724 [2018-11-06 19:56:43,375 INFO L226 Difference]: Without dead ends: 70722 [2018-11-06 19:56:43,428 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:43,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70722 states. [2018-11-06 19:56:44,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70722 to 69483. [2018-11-06 19:56:44,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69483 states. [2018-11-06 19:56:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69483 states to 69483 states and 78479 transitions. [2018-11-06 19:56:44,762 INFO L78 Accepts]: Start accepts. Automaton has 69483 states and 78479 transitions. Word has length 307 [2018-11-06 19:56:44,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:44,763 INFO L480 AbstractCegarLoop]: Abstraction has 69483 states and 78479 transitions. [2018-11-06 19:56:44,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:56:44,763 INFO L276 IsEmpty]: Start isEmpty. Operand 69483 states and 78479 transitions. [2018-11-06 19:56:44,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-11-06 19:56:44,794 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:44,794 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:56:44,795 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:44,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:44,795 INFO L82 PathProgramCache]: Analyzing trace with hash -976902293, now seen corresponding path program 1 times [2018-11-06 19:56:44,795 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:44,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:44,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:44,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:44,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:56:45,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:45,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:45,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:56:45,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:56:45,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:45,183 INFO L87 Difference]: Start difference. First operand 69483 states and 78479 transitions. Second operand 4 states. [2018-11-06 19:56:47,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:47,956 INFO L93 Difference]: Finished difference Result 139191 states and 157209 transitions. [2018-11-06 19:56:47,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:56:47,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2018-11-06 19:56:47,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:48,037 INFO L225 Difference]: With dead ends: 139191 [2018-11-06 19:56:48,037 INFO L226 Difference]: Without dead ends: 69710 [2018-11-06 19:56:48,087 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:48,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69710 states. [2018-11-06 19:56:48,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69710 to 69483. [2018-11-06 19:56:48,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69483 states. [2018-11-06 19:56:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69483 states to 69483 states and 78077 transitions. [2018-11-06 19:56:48,790 INFO L78 Accepts]: Start accepts. Automaton has 69483 states and 78077 transitions. Word has length 308 [2018-11-06 19:56:48,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:48,790 INFO L480 AbstractCegarLoop]: Abstraction has 69483 states and 78077 transitions. [2018-11-06 19:56:48,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:56:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 69483 states and 78077 transitions. [2018-11-06 19:56:48,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-06 19:56:48,823 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:48,824 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:56:48,824 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:48,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:48,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1729129238, now seen corresponding path program 1 times [2018-11-06 19:56:48,825 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:48,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:48,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:48,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:48,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:49,414 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:56:49,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:49,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:49,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:56:49,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:56:49,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:49,416 INFO L87 Difference]: Start difference. First operand 69483 states and 78077 transitions. Second operand 4 states. [2018-11-06 19:56:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:51,523 INFO L93 Difference]: Finished difference Result 266066 states and 298852 transitions. [2018-11-06 19:56:51,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:56:51,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2018-11-06 19:56:51,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:51,763 INFO L225 Difference]: With dead ends: 266066 [2018-11-06 19:56:51,763 INFO L226 Difference]: Without dead ends: 196585 [2018-11-06 19:56:51,827 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:51,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196585 states. [2018-11-06 19:56:53,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196585 to 128124. [2018-11-06 19:56:53,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128124 states. [2018-11-06 19:56:53,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128124 states to 128124 states and 143871 transitions. [2018-11-06 19:56:53,535 INFO L78 Accepts]: Start accepts. Automaton has 128124 states and 143871 transitions. Word has length 328 [2018-11-06 19:56:53,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:53,536 INFO L480 AbstractCegarLoop]: Abstraction has 128124 states and 143871 transitions. [2018-11-06 19:56:53,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:56:53,536 INFO L276 IsEmpty]: Start isEmpty. Operand 128124 states and 143871 transitions. [2018-11-06 19:56:53,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-11-06 19:56:53,565 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:53,565 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:56:53,566 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:53,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:53,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1848161845, now seen corresponding path program 1 times [2018-11-06 19:56:53,566 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:53,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:53,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:53,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:53,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:54,879 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-06 19:56:54,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:54,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:54,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:56:54,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:56:54,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:54,881 INFO L87 Difference]: Start difference. First operand 128124 states and 143871 transitions. Second operand 4 states. [2018-11-06 19:56:57,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:57,355 INFO L93 Difference]: Finished difference Result 375960 states and 421631 transitions. [2018-11-06 19:56:57,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:56:57,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 350 [2018-11-06 19:56:57,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:57,649 INFO L225 Difference]: With dead ends: 375960 [2018-11-06 19:56:57,649 INFO L226 Difference]: Without dead ends: 247838 [2018-11-06 19:56:57,755 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247838 states. [2018-11-06 19:57:01,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247838 to 247834. [2018-11-06 19:57:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247834 states. [2018-11-06 19:57:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247834 states to 247834 states and 277625 transitions. [2018-11-06 19:57:01,381 INFO L78 Accepts]: Start accepts. Automaton has 247834 states and 277625 transitions. Word has length 350 [2018-11-06 19:57:01,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:57:01,381 INFO L480 AbstractCegarLoop]: Abstraction has 247834 states and 277625 transitions. [2018-11-06 19:57:01,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:57:01,381 INFO L276 IsEmpty]: Start isEmpty. Operand 247834 states and 277625 transitions. [2018-11-06 19:57:01,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-11-06 19:57:01,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:01,433 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:57:01,433 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:01,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:01,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1357701147, now seen corresponding path program 1 times [2018-11-06 19:57:01,433 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:01,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:01,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:01,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:01,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:02,175 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-06 19:57:02,379 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 174 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:57:02,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:57:02,379 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:57:02,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:02,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:57:02,813 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-06 19:57:02,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:57:02,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-11-06 19:57:02,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:57:02,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:57:02,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:57:02,838 INFO L87 Difference]: Start difference. First operand 247834 states and 277625 transitions. Second operand 7 states. [2018-11-06 19:57:18,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:57:18,436 INFO L93 Difference]: Finished difference Result 587529 states and 661295 transitions. [2018-11-06 19:57:18,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-06 19:57:18,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 359 [2018-11-06 19:57:18,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:57:18,919 INFO L225 Difference]: With dead ends: 587529 [2018-11-06 19:57:18,920 INFO L226 Difference]: Without dead ends: 339697 [2018-11-06 19:57:19,084 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-06 19:57:19,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339697 states. [2018-11-06 19:57:23,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339697 to 328120. [2018-11-06 19:57:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328120 states. [2018-11-06 19:57:33,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328120 states to 328120 states and 362537 transitions. [2018-11-06 19:57:33,655 INFO L78 Accepts]: Start accepts. Automaton has 328120 states and 362537 transitions. Word has length 359 [2018-11-06 19:57:33,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:57:33,655 INFO L480 AbstractCegarLoop]: Abstraction has 328120 states and 362537 transitions. [2018-11-06 19:57:33,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:57:33,655 INFO L276 IsEmpty]: Start isEmpty. Operand 328120 states and 362537 transitions. [2018-11-06 19:57:33,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-11-06 19:57:33,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:33,779 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:57:33,780 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:33,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:33,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1334160662, now seen corresponding path program 1 times [2018-11-06 19:57:33,780 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:33,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:33,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:33,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:33,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-06 19:57:34,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:57:34,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:57:34,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:57:34,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:57:34,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:57:34,070 INFO L87 Difference]: Start difference. First operand 328120 states and 362537 transitions. Second operand 3 states. [2018-11-06 19:57:38,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:57:38,556 INFO L93 Difference]: Finished difference Result 635793 states and 703466 transitions. [2018-11-06 19:57:38,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:57:38,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 383 [2018-11-06 19:57:38,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:57:39,014 INFO L225 Difference]: With dead ends: 635793 [2018-11-06 19:57:39,014 INFO L226 Difference]: Without dead ends: 307675 [2018-11-06 19:57:39,228 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:57:39,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307675 states. [2018-11-06 19:57:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307675 to 305791. [2018-11-06 19:57:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305791 states. [2018-11-06 19:57:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305791 states to 305791 states and 332074 transitions. [2018-11-06 19:57:44,455 INFO L78 Accepts]: Start accepts. Automaton has 305791 states and 332074 transitions. Word has length 383 [2018-11-06 19:57:44,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:57:44,456 INFO L480 AbstractCegarLoop]: Abstraction has 305791 states and 332074 transitions. [2018-11-06 19:57:44,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:57:44,456 INFO L276 IsEmpty]: Start isEmpty. Operand 305791 states and 332074 transitions. [2018-11-06 19:57:44,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-11-06 19:57:44,514 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:44,514 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:57:44,514 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:44,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:44,515 INFO L82 PathProgramCache]: Analyzing trace with hash 611533469, now seen corresponding path program 1 times [2018-11-06 19:57:44,515 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:44,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:44,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:44,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:44,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:44,975 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-06 19:57:44,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:57:44,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 19:57:44,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:57:44,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:57:44,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:57:44,977 INFO L87 Difference]: Start difference. First operand 305791 states and 332074 transitions. Second operand 5 states. [2018-11-06 19:57:50,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:57:50,512 INFO L93 Difference]: Finished difference Result 675128 states and 733051 transitions. [2018-11-06 19:57:50,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:57:50,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 418 [2018-11-06 19:57:50,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:57:50,998 INFO L225 Difference]: With dead ends: 675128 [2018-11-06 19:57:50,998 INFO L226 Difference]: Without dead ends: 369339 [2018-11-06 19:57:51,170 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:57:51,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369339 states. [2018-11-06 19:57:56,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369339 to 324031. [2018-11-06 19:57:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324031 states. [2018-11-06 19:57:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324031 states to 324031 states and 353570 transitions. [2018-11-06 19:57:57,215 INFO L78 Accepts]: Start accepts. Automaton has 324031 states and 353570 transitions. Word has length 418 [2018-11-06 19:57:57,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:57:57,215 INFO L480 AbstractCegarLoop]: Abstraction has 324031 states and 353570 transitions. [2018-11-06 19:57:57,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:57:57,215 INFO L276 IsEmpty]: Start isEmpty. Operand 324031 states and 353570 transitions. [2018-11-06 19:57:57,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-11-06 19:57:57,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:57,277 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:57:57,277 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:57,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:57,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1047361035, now seen corresponding path program 1 times [2018-11-06 19:57:57,278 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:57,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:57,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:57,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:57,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:57,747 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-06 19:57:57,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:57:57,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:57:57,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:57:57,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:57:57,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:57:57,750 INFO L87 Difference]: Start difference. First operand 324031 states and 353570 transitions. Second operand 4 states. [2018-11-06 19:58:06,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:06,605 INFO L93 Difference]: Finished difference Result 794483 states and 864241 transitions. [2018-11-06 19:58:06,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:58:06,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 437 [2018-11-06 19:58:06,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:07,236 INFO L225 Difference]: With dead ends: 794483 [2018-11-06 19:58:07,236 INFO L226 Difference]: Without dead ends: 470454 [2018-11-06 19:58:07,442 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:58:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470454 states. [2018-11-06 19:58:13,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470454 to 394029. [2018-11-06 19:58:13,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394029 states. [2018-11-06 19:58:13,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394029 states to 394029 states and 427048 transitions. [2018-11-06 19:58:13,721 INFO L78 Accepts]: Start accepts. Automaton has 394029 states and 427048 transitions. Word has length 437 [2018-11-06 19:58:13,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:13,722 INFO L480 AbstractCegarLoop]: Abstraction has 394029 states and 427048 transitions. [2018-11-06 19:58:13,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:58:13,722 INFO L276 IsEmpty]: Start isEmpty. Operand 394029 states and 427048 transitions. [2018-11-06 19:58:13,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-11-06 19:58:13,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:13,807 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:58:13,808 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:13,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:13,808 INFO L82 PathProgramCache]: Analyzing trace with hash -291768363, now seen corresponding path program 1 times [2018-11-06 19:58:13,808 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:13,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:13,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:13,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:13,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 347 proven. 55 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-06 19:58:16,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:58:16,181 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:58:16,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:16,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:58:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-11-06 19:58:16,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:58:16,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-11-06 19:58:16,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 19:58:16,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 19:58:16,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-06 19:58:16,555 INFO L87 Difference]: Start difference. First operand 394029 states and 427048 transitions. Second operand 10 states. [2018-11-06 19:58:17,313 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-06 19:58:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:30,049 INFO L93 Difference]: Finished difference Result 914684 states and 991511 transitions. [2018-11-06 19:58:30,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-06 19:58:30,050 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 454 [2018-11-06 19:58:30,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:30,798 INFO L225 Difference]: With dead ends: 914684 [2018-11-06 19:58:30,799 INFO L226 Difference]: Without dead ends: 520657 [2018-11-06 19:58:30,997 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 461 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2018-11-06 19:58:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520657 states. [2018-11-06 19:58:37,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520657 to 489901. [2018-11-06 19:58:37,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489901 states. [2018-11-06 19:58:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489901 states to 489901 states and 529092 transitions. [2018-11-06 19:58:39,235 INFO L78 Accepts]: Start accepts. Automaton has 489901 states and 529092 transitions. Word has length 454 [2018-11-06 19:58:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:39,236 INFO L480 AbstractCegarLoop]: Abstraction has 489901 states and 529092 transitions. [2018-11-06 19:58:39,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 19:58:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 489901 states and 529092 transitions. [2018-11-06 19:58:39,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2018-11-06 19:58:39,353 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:39,353 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:39,353 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:39,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:39,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1550698709, now seen corresponding path program 1 times [2018-11-06 19:58:39,354 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:39,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:39,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:39,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:39,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-11-06 19:58:39,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:39,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:39,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:58:39,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:58:39,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:39,717 INFO L87 Difference]: Start difference. First operand 489901 states and 529092 transitions. Second operand 3 states. [2018-11-06 19:58:50,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:50,899 INFO L93 Difference]: Finished difference Result 1267466 states and 1365727 transitions. [2018-11-06 19:58:50,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:58:50,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 465 [2018-11-06 19:58:50,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:52,089 INFO L225 Difference]: With dead ends: 1267466 [2018-11-06 19:58:52,089 INFO L226 Difference]: Without dead ends: 777567 [2018-11-06 19:58:52,347 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:58:52,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777567 states. [2018-11-06 19:59:03,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777567 to 721230. [2018-11-06 19:59:03,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721230 states. [2018-11-06 19:59:04,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721230 states to 721230 states and 775648 transitions. [2018-11-06 19:59:04,623 INFO L78 Accepts]: Start accepts. Automaton has 721230 states and 775648 transitions. Word has length 465 [2018-11-06 19:59:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:04,623 INFO L480 AbstractCegarLoop]: Abstraction has 721230 states and 775648 transitions. [2018-11-06 19:59:04,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:59:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand 721230 states and 775648 transitions. [2018-11-06 19:59:04,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-11-06 19:59:04,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:04,760 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:59:04,761 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:04,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:04,761 INFO L82 PathProgramCache]: Analyzing trace with hash -48158721, now seen corresponding path program 1 times [2018-11-06 19:59:04,761 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:04,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:04,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:04,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:04,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:06,528 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-06 19:59:06,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:06,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:59:06,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:06,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:06,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:06,530 INFO L87 Difference]: Start difference. First operand 721230 states and 775648 transitions. Second operand 3 states. [2018-11-06 19:59:16,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:16,009 INFO L93 Difference]: Finished difference Result 1956732 states and 2102620 transitions. [2018-11-06 19:59:16,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:16,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 466 [2018-11-06 19:59:16,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:17,877 INFO L225 Difference]: With dead ends: 1956732 [2018-11-06 19:59:17,877 INFO L226 Difference]: Without dead ends: 1174415