java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label41_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:04:43,990 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:04:43,992 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:04:44,004 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:04:44,005 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:04:44,006 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:04:44,007 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:04:44,008 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:04:44,010 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:04:44,011 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:04:44,012 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:04:44,012 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:04:44,013 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:04:44,014 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:04:44,015 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:04:44,016 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:04:44,017 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:04:44,019 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:04:44,021 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:04:44,022 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:04:44,023 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:04:44,025 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:04:44,027 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:04:44,027 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:04:44,028 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:04:44,029 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:04:44,030 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:04:44,030 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:04:44,031 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:04:44,032 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:04:44,033 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:04:44,033 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:04:44,034 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:04:44,034 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:04:44,035 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:04:44,036 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:04:44,036 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 20:04:44,051 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:04:44,052 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:04:44,053 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:04:44,053 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 20:04:44,053 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 20:04:44,054 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 20:04:44,054 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 20:04:44,054 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:04:44,054 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:04:44,054 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:04:44,055 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:04:44,055 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:04:44,055 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:04:44,055 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:04:44,055 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:04:44,056 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:04:44,056 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:04:44,056 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:04:44,056 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:04:44,056 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:04:44,057 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:04:44,057 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:04:44,057 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:04:44,057 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 20:04:44,057 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:04:44,057 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:04:44,058 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 20:04:44,058 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 20:04:44,101 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:04:44,122 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:04:44,127 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:04:44,128 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:04:44,129 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:04:44,130 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label41_true-unreach-call.c [2018-10-26 20:04:44,197 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/92018cc1a/f4963342255a488e95baa4117f0b1d3c/FLAGc2ac5d3fd [2018-10-26 20:04:44,855 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:04:44,856 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label41_true-unreach-call.c [2018-10-26 20:04:44,879 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/92018cc1a/f4963342255a488e95baa4117f0b1d3c/FLAGc2ac5d3fd [2018-10-26 20:04:44,899 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/92018cc1a/f4963342255a488e95baa4117f0b1d3c [2018-10-26 20:04:44,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:04:44,914 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 20:04:44,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:04:44,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:04:44,922 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:04:44,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:04:44" (1/1) ... [2018-10-26 20:04:44,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d1fe75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:44, skipping insertion in model container [2018-10-26 20:04:44,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:04:44" (1/1) ... [2018-10-26 20:04:44,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:04:45,028 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:04:45,862 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:04:45,869 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:04:46,125 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:04:46,153 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:04:46,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:46 WrapperNode [2018-10-26 20:04:46,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:04:46,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:04:46,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:04:46,159 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:04:46,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:46" (1/1) ... [2018-10-26 20:04:46,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:46" (1/1) ... [2018-10-26 20:04:46,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:04:46,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:04:46,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:04:46,481 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:04:46,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:46" (1/1) ... [2018-10-26 20:04:46,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:46" (1/1) ... [2018-10-26 20:04:46,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:46" (1/1) ... [2018-10-26 20:04:46,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:46" (1/1) ... [2018-10-26 20:04:46,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:46" (1/1) ... [2018-10-26 20:04:46,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:46" (1/1) ... [2018-10-26 20:04:46,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:46" (1/1) ... [2018-10-26 20:04:46,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:04:46,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:04:46,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:04:46,616 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:04:46,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:04:46,700 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 20:04:46,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:04:46,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:04:52,458 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:04:52,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:04:52 BoogieIcfgContainer [2018-10-26 20:04:52,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:04:52,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:04:52,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:04:52,465 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:04:52,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:04:44" (1/3) ... [2018-10-26 20:04:52,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c9b8e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:04:52, skipping insertion in model container [2018-10-26 20:04:52,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:04:46" (2/3) ... [2018-10-26 20:04:52,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c9b8e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:04:52, skipping insertion in model container [2018-10-26 20:04:52,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:04:52" (3/3) ... [2018-10-26 20:04:52,470 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label41_true-unreach-call.c [2018-10-26 20:04:52,481 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:04:52,493 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:04:52,513 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:04:52,558 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 20:04:52,559 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:04:52,559 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:04:52,560 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:04:52,560 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:04:52,560 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:04:52,560 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:04:52,560 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:04:52,561 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:04:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-26 20:04:52,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-26 20:04:52,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:52,615 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] [2018-10-26 20:04:52,618 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:52,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:52,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1542586394, now seen corresponding path program 1 times [2018-10-26 20:04:52,627 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:52,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:52,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:52,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:52,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:53,613 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-26 20:04:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:53,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:53,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:04:53,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:53,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:53,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:53,762 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-26 20:04:57,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:57,568 INFO L93 Difference]: Finished difference Result 1072 states and 1917 transitions. [2018-10-26 20:04:57,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:57,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-10-26 20:04:57,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:57,602 INFO L225 Difference]: With dead ends: 1072 [2018-10-26 20:04:57,602 INFO L226 Difference]: Without dead ends: 762 [2018-10-26 20:04:57,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:57,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-10-26 20:04:57,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 518. [2018-10-26 20:04:57,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-10-26 20:04:57,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 855 transitions. [2018-10-26 20:04:57,711 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 855 transitions. Word has length 183 [2018-10-26 20:04:57,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:57,712 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 855 transitions. [2018-10-26 20:04:57,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:57,713 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 855 transitions. [2018-10-26 20:04:57,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-26 20:04:57,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:57,719 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:04:57,720 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:57,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:57,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1845542153, now seen corresponding path program 1 times [2018-10-26 20:04:57,721 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:57,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:57,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:57,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:57,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:58,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:58,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:04:58,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:58,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:58,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:58,043 INFO L87 Difference]: Start difference. First operand 518 states and 855 transitions. Second operand 4 states. [2018-10-26 20:05:01,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:01,927 INFO L93 Difference]: Finished difference Result 1917 states and 3253 transitions. [2018-10-26 20:05:01,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:01,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2018-10-26 20:05:01,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:01,945 INFO L225 Difference]: With dead ends: 1917 [2018-10-26 20:05:01,946 INFO L226 Difference]: Without dead ends: 1401 [2018-10-26 20:05:01,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:01,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2018-10-26 20:05:02,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 933. [2018-10-26 20:05:02,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-26 20:05:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1472 transitions. [2018-10-26 20:05:02,007 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1472 transitions. Word has length 189 [2018-10-26 20:05:02,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:02,007 INFO L481 AbstractCegarLoop]: Abstraction has 933 states and 1472 transitions. [2018-10-26 20:05:02,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:02,007 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1472 transitions. [2018-10-26 20:05:02,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-26 20:05:02,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:02,013 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] [2018-10-26 20:05:02,013 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:02,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:02,014 INFO L82 PathProgramCache]: Analyzing trace with hash -40059333, now seen corresponding path program 1 times [2018-10-26 20:05:02,014 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:02,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:02,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:02,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:02,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:02,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:02,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:02,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:05:02,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:02,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:02,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:02,156 INFO L87 Difference]: Start difference. First operand 933 states and 1472 transitions. Second operand 3 states. [2018-10-26 20:05:04,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:04,702 INFO L93 Difference]: Finished difference Result 2699 states and 4315 transitions. [2018-10-26 20:05:04,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:04,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2018-10-26 20:05:04,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:04,713 INFO L225 Difference]: With dead ends: 2699 [2018-10-26 20:05:04,713 INFO L226 Difference]: Without dead ends: 1768 [2018-10-26 20:05:04,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:04,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-10-26 20:05:04,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1751. [2018-10-26 20:05:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2018-10-26 20:05:04,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2699 transitions. [2018-10-26 20:05:04,755 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2699 transitions. Word has length 192 [2018-10-26 20:05:04,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:04,755 INFO L481 AbstractCegarLoop]: Abstraction has 1751 states and 2699 transitions. [2018-10-26 20:05:04,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:04,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2699 transitions. [2018-10-26 20:05:04,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-26 20:05:04,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:04,761 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-10-26 20:05:04,762 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:04,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:04,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1107131409, now seen corresponding path program 1 times [2018-10-26 20:05:04,762 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:04,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:04,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:04,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:04,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:04,878 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 20:05:04,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:04,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:05:04,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:04,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:04,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:04,880 INFO L87 Difference]: Start difference. First operand 1751 states and 2699 transitions. Second operand 3 states. [2018-10-26 20:05:06,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:06,416 INFO L93 Difference]: Finished difference Result 4329 states and 6639 transitions. [2018-10-26 20:05:06,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:06,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2018-10-26 20:05:06,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:06,430 INFO L225 Difference]: With dead ends: 4329 [2018-10-26 20:05:06,430 INFO L226 Difference]: Without dead ends: 2580 [2018-10-26 20:05:06,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:06,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2018-10-26 20:05:06,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2579. [2018-10-26 20:05:06,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2579 states. [2018-10-26 20:05:06,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 3884 transitions. [2018-10-26 20:05:06,482 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 3884 transitions. Word has length 200 [2018-10-26 20:05:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:06,482 INFO L481 AbstractCegarLoop]: Abstraction has 2579 states and 3884 transitions. [2018-10-26 20:05:06,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 3884 transitions. [2018-10-26 20:05:06,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-26 20:05:06,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:06,489 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2018-10-26 20:05:06,490 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:06,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:06,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1875654890, now seen corresponding path program 1 times [2018-10-26 20:05:06,490 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:06,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:06,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:06,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:06,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 20:05:06,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:06,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:05:06,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:06,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:06,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:06,622 INFO L87 Difference]: Start difference. First operand 2579 states and 3884 transitions. Second operand 3 states. [2018-10-26 20:05:07,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:07,246 INFO L93 Difference]: Finished difference Result 7713 states and 11623 transitions. [2018-10-26 20:05:07,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:07,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2018-10-26 20:05:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:07,277 INFO L225 Difference]: With dead ends: 7713 [2018-10-26 20:05:07,278 INFO L226 Difference]: Without dead ends: 5136 [2018-10-26 20:05:07,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5136 states. [2018-10-26 20:05:07,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5136 to 5133. [2018-10-26 20:05:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5133 states. [2018-10-26 20:05:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5133 states to 5133 states and 7720 transitions. [2018-10-26 20:05:07,399 INFO L78 Accepts]: Start accepts. Automaton has 5133 states and 7720 transitions. Word has length 206 [2018-10-26 20:05:07,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:07,400 INFO L481 AbstractCegarLoop]: Abstraction has 5133 states and 7720 transitions. [2018-10-26 20:05:07,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 5133 states and 7720 transitions. [2018-10-26 20:05:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-26 20:05:07,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:07,411 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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-10-26 20:05:07,411 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:07,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:07,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1741862557, now seen corresponding path program 1 times [2018-10-26 20:05:07,412 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:07,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:07,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:07,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:07,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:07,755 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 20:05:07,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:05:07,756 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:05:07,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:07,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 20:05:07,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:05:07,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-10-26 20:05:07,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:07,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:07,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:07,990 INFO L87 Difference]: Start difference. First operand 5133 states and 7720 transitions. Second operand 4 states. [2018-10-26 20:05:09,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:09,612 INFO L93 Difference]: Finished difference Result 20487 states and 30826 transitions. [2018-10-26 20:05:09,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:09,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 215 [2018-10-26 20:05:09,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:09,684 INFO L225 Difference]: With dead ends: 20487 [2018-10-26 20:05:09,684 INFO L226 Difference]: Without dead ends: 15356 [2018-10-26 20:05:09,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:09,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15356 states. [2018-10-26 20:05:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15356 to 10229. [2018-10-26 20:05:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10229 states. [2018-10-26 20:05:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10229 states to 10229 states and 15363 transitions. [2018-10-26 20:05:09,933 INFO L78 Accepts]: Start accepts. Automaton has 10229 states and 15363 transitions. Word has length 215 [2018-10-26 20:05:09,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:09,934 INFO L481 AbstractCegarLoop]: Abstraction has 10229 states and 15363 transitions. [2018-10-26 20:05:09,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:09,934 INFO L276 IsEmpty]: Start isEmpty. Operand 10229 states and 15363 transitions. [2018-10-26 20:05:09,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-26 20:05:09,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:09,952 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:09,952 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:09,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:09,952 INFO L82 PathProgramCache]: Analyzing trace with hash -239700322, now seen corresponding path program 1 times [2018-10-26 20:05:09,952 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:09,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:09,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:09,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:09,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:10,476 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-26 20:05:10,535 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:10,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:10,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:05:10,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:05:10,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:05:10,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:05:10,537 INFO L87 Difference]: Start difference. First operand 10229 states and 15363 transitions. Second operand 5 states. [2018-10-26 20:05:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:13,570 INFO L93 Difference]: Finished difference Result 23029 states and 35010 transitions. [2018-10-26 20:05:13,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:05:13,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2018-10-26 20:05:13,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:13,608 INFO L225 Difference]: With dead ends: 23029 [2018-10-26 20:05:13,608 INFO L226 Difference]: Without dead ends: 12802 [2018-10-26 20:05:13,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:05:13,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12802 states. [2018-10-26 20:05:13,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12802 to 11045. [2018-10-26 20:05:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11045 states. [2018-10-26 20:05:13,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11045 states to 11045 states and 16559 transitions. [2018-10-26 20:05:13,813 INFO L78 Accepts]: Start accepts. Automaton has 11045 states and 16559 transitions. Word has length 223 [2018-10-26 20:05:13,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:13,814 INFO L481 AbstractCegarLoop]: Abstraction has 11045 states and 16559 transitions. [2018-10-26 20:05:13,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:05:13,814 INFO L276 IsEmpty]: Start isEmpty. Operand 11045 states and 16559 transitions. [2018-10-26 20:05:13,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-26 20:05:13,833 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:13,834 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:13,834 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:13,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:13,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1949917310, now seen corresponding path program 1 times [2018-10-26 20:05:13,835 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:13,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:13,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:13,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:13,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:14,314 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-26 20:05:14,567 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-26 20:05:14,896 WARN L179 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-10-26 20:05:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:14,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:05:14,940 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:05:14,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:15,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:05:15,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:05:15,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-26 20:05:15,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:05:15,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:05:15,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:05:15,275 INFO L87 Difference]: Start difference. First operand 11045 states and 16559 transitions. Second operand 7 states. [2018-10-26 20:05:15,469 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 20:05:21,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:21,993 INFO L93 Difference]: Finished difference Result 58087 states and 84611 transitions. [2018-10-26 20:05:21,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 20:05:21,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 233 [2018-10-26 20:05:21,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:22,082 INFO L225 Difference]: With dead ends: 58087 [2018-10-26 20:05:22,083 INFO L226 Difference]: Without dead ends: 47044 [2018-10-26 20:05:22,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-26 20:05:22,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47044 states. [2018-10-26 20:05:22,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47044 to 45800. [2018-10-26 20:05:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45800 states. [2018-10-26 20:05:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45800 states to 45800 states and 56726 transitions. [2018-10-26 20:05:22,831 INFO L78 Accepts]: Start accepts. Automaton has 45800 states and 56726 transitions. Word has length 233 [2018-10-26 20:05:22,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:22,831 INFO L481 AbstractCegarLoop]: Abstraction has 45800 states and 56726 transitions. [2018-10-26 20:05:22,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:05:22,831 INFO L276 IsEmpty]: Start isEmpty. Operand 45800 states and 56726 transitions. [2018-10-26 20:05:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-26 20:05:22,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:22,875 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 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] [2018-10-26 20:05:22,876 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:22,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:22,878 INFO L82 PathProgramCache]: Analyzing trace with hash 838847358, now seen corresponding path program 1 times [2018-10-26 20:05:22,878 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:22,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:22,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:22,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:22,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:23,041 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-26 20:05:23,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:23,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:23,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:23,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:23,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:23,043 INFO L87 Difference]: Start difference. First operand 45800 states and 56726 transitions. Second operand 3 states. [2018-10-26 20:05:25,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:25,599 INFO L93 Difference]: Finished difference Result 105274 states and 132479 transitions. [2018-10-26 20:05:25,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:25,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2018-10-26 20:05:25,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:25,680 INFO L225 Difference]: With dead ends: 105274 [2018-10-26 20:05:25,680 INFO L226 Difference]: Without dead ends: 59476 [2018-10-26 20:05:25,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:25,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59476 states. [2018-10-26 20:05:26,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59476 to 59468. [2018-10-26 20:05:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59468 states. [2018-10-26 20:05:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59468 states to 59468 states and 70978 transitions. [2018-10-26 20:05:26,853 INFO L78 Accepts]: Start accepts. Automaton has 59468 states and 70978 transitions. Word has length 245 [2018-10-26 20:05:26,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:26,854 INFO L481 AbstractCegarLoop]: Abstraction has 59468 states and 70978 transitions. [2018-10-26 20:05:26,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:26,854 INFO L276 IsEmpty]: Start isEmpty. Operand 59468 states and 70978 transitions. [2018-10-26 20:05:26,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-10-26 20:05:26,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:26,897 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:26,897 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:26,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:26,897 INFO L82 PathProgramCache]: Analyzing trace with hash -557160164, now seen corresponding path program 1 times [2018-10-26 20:05:26,898 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:26,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:26,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:26,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:26,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-26 20:05:27,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:27,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:05:27,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:27,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:27,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:27,114 INFO L87 Difference]: Start difference. First operand 59468 states and 70978 transitions. Second operand 3 states. [2018-10-26 20:05:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:28,167 INFO L93 Difference]: Finished difference Result 116380 states and 139034 transitions. [2018-10-26 20:05:28,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:28,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2018-10-26 20:05:28,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:28,235 INFO L225 Difference]: With dead ends: 116380 [2018-10-26 20:05:28,236 INFO L226 Difference]: Without dead ends: 56914 [2018-10-26 20:05:28,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:28,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56914 states. [2018-10-26 20:05:28,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56914 to 56914. [2018-10-26 20:05:28,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56914 states. [2018-10-26 20:05:28,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56914 states to 56914 states and 66991 transitions. [2018-10-26 20:05:28,952 INFO L78 Accepts]: Start accepts. Automaton has 56914 states and 66991 transitions. Word has length 287 [2018-10-26 20:05:28,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:28,953 INFO L481 AbstractCegarLoop]: Abstraction has 56914 states and 66991 transitions. [2018-10-26 20:05:28,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:28,953 INFO L276 IsEmpty]: Start isEmpty. Operand 56914 states and 66991 transitions. [2018-10-26 20:05:28,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-26 20:05:28,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:28,983 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] [2018-10-26 20:05:28,983 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:28,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:28,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1619691015, now seen corresponding path program 1 times [2018-10-26 20:05:28,984 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:28,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:28,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:28,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:28,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:29,849 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 20:05:29,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:29,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:05:29,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:29,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:29,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:29,851 INFO L87 Difference]: Start difference. First operand 56914 states and 66991 transitions. Second operand 3 states. [2018-10-26 20:05:30,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:30,844 INFO L93 Difference]: Finished difference Result 159633 states and 188339 transitions. [2018-10-26 20:05:30,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:30,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2018-10-26 20:05:30,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:30,974 INFO L225 Difference]: With dead ends: 159633 [2018-10-26 20:05:30,974 INFO L226 Difference]: Without dead ends: 102721 [2018-10-26 20:05:31,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:31,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102721 states. [2018-10-26 20:05:32,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102721 to 102717. [2018-10-26 20:05:32,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102717 states. [2018-10-26 20:05:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102717 states to 102717 states and 121291 transitions. [2018-10-26 20:05:32,364 INFO L78 Accepts]: Start accepts. Automaton has 102717 states and 121291 transitions. Word has length 337 [2018-10-26 20:05:32,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:32,365 INFO L481 AbstractCegarLoop]: Abstraction has 102717 states and 121291 transitions. [2018-10-26 20:05:32,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:32,365 INFO L276 IsEmpty]: Start isEmpty. Operand 102717 states and 121291 transitions. [2018-10-26 20:05:32,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-10-26 20:05:32,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:32,424 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:32,424 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:32,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:32,425 INFO L82 PathProgramCache]: Analyzing trace with hash 15499286, now seen corresponding path program 1 times [2018-10-26 20:05:32,425 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:32,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:32,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:32,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:32,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 20:05:32,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:32,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:05:32,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:32,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:32,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:32,886 INFO L87 Difference]: Start difference. First operand 102717 states and 121291 transitions. Second operand 4 states. [2018-10-26 20:05:36,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:36,589 INFO L93 Difference]: Finished difference Result 257684 states and 302483 transitions. [2018-10-26 20:05:36,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:36,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 381 [2018-10-26 20:05:36,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:36,767 INFO L225 Difference]: With dead ends: 257684 [2018-10-26 20:05:36,767 INFO L226 Difference]: Without dead ends: 154969 [2018-10-26 20:05:36,837 INFO L605 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-10-26 20:05:36,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154969 states. [2018-10-26 20:05:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154969 to 139365. [2018-10-26 20:05:38,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139365 states. [2018-10-26 20:05:38,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139365 states to 139365 states and 161240 transitions. [2018-10-26 20:05:38,351 INFO L78 Accepts]: Start accepts. Automaton has 139365 states and 161240 transitions. Word has length 381 [2018-10-26 20:05:38,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:38,351 INFO L481 AbstractCegarLoop]: Abstraction has 139365 states and 161240 transitions. [2018-10-26 20:05:38,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:38,351 INFO L276 IsEmpty]: Start isEmpty. Operand 139365 states and 161240 transitions. [2018-10-26 20:05:38,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-10-26 20:05:38,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:38,432 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:38,433 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:38,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:38,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1554796466, now seen corresponding path program 1 times [2018-10-26 20:05:38,433 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:38,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:38,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:38,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:38,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:39,595 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 379 proven. 6 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-26 20:05:39,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:05:39,596 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:05:39,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:39,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-10-26 20:05:39,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:05:39,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-26 20:05:39,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:05:39,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:05:39,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:05:39,912 INFO L87 Difference]: Start difference. First operand 139365 states and 161240 transitions. Second operand 5 states. [2018-10-26 20:05:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:44,967 INFO L93 Difference]: Finished difference Result 800926 states and 921990 transitions. [2018-10-26 20:05:44,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:05:44,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 405 [2018-10-26 20:05:44,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:45,850 INFO L225 Difference]: With dead ends: 800926 [2018-10-26 20:05:45,851 INFO L226 Difference]: Without dead ends: 661563 [2018-10-26 20:05:47,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:05:47,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661563 states. [2018-10-26 20:05:53,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661563 to 453574. [2018-10-26 20:05:53,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453574 states. [2018-10-26 20:05:56,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453574 states to 453574 states and 520341 transitions. [2018-10-26 20:05:56,298 INFO L78 Accepts]: Start accepts. Automaton has 453574 states and 520341 transitions. Word has length 405 [2018-10-26 20:05:56,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:56,299 INFO L481 AbstractCegarLoop]: Abstraction has 453574 states and 520341 transitions. [2018-10-26 20:05:56,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:05:56,299 INFO L276 IsEmpty]: Start isEmpty. Operand 453574 states and 520341 transitions. [2018-10-26 20:05:56,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-10-26 20:05:56,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:56,444 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:56,444 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:56,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:56,444 INFO L82 PathProgramCache]: Analyzing trace with hash -536930713, now seen corresponding path program 1 times [2018-10-26 20:05:56,444 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:56,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:56,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:56,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:56,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 1 proven. 200 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-10-26 20:05:57,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:05:57,668 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:05:57,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:57,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:58,227 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-26 20:05:58,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:05:58,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-10-26 20:05:58,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 20:05:58,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 20:05:58,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:05:58,268 INFO L87 Difference]: Start difference. First operand 453574 states and 520341 transitions. Second operand 10 states. [2018-10-26 20:06:19,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:19,589 INFO L93 Difference]: Finished difference Result 1228680 states and 1440338 transitions. [2018-10-26 20:06:19,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-26 20:06:19,590 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 412 [2018-10-26 20:06:19,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:20,621 INFO L225 Difference]: With dead ends: 1228680 [2018-10-26 20:06:20,621 INFO L226 Difference]: Without dead ends: 775108 [2018-10-26 20:06:20,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 420 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2018-10-26 20:06:21,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775108 states. [2018-10-26 20:06:31,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775108 to 614930. [2018-10-26 20:06:31,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614930 states. [2018-10-26 20:06:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614930 states to 614930 states and 699958 transitions. [2018-10-26 20:06:32,127 INFO L78 Accepts]: Start accepts. Automaton has 614930 states and 699958 transitions. Word has length 412 [2018-10-26 20:06:32,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:32,128 INFO L481 AbstractCegarLoop]: Abstraction has 614930 states and 699958 transitions. [2018-10-26 20:06:32,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 20:06:32,128 INFO L276 IsEmpty]: Start isEmpty. Operand 614930 states and 699958 transitions. [2018-10-26 20:06:32,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-10-26 20:06:32,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:32,276 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:06:32,276 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:32,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:32,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1998143988, now seen corresponding path program 1 times [2018-10-26 20:06:32,277 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:32,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:32,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:32,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:32,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:34,221 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-26 20:06:34,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:34,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:34,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:06:34,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:06:34,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:06:34,223 INFO L87 Difference]: Start difference. First operand 614930 states and 699958 transitions. Second operand 4 states. [2018-10-26 20:06:51,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:51,268 INFO L93 Difference]: Finished difference Result 1605907 states and 1821245 transitions. [2018-10-26 20:06:51,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:06:51,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 423 [2018-10-26 20:06:51,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:52,652 INFO L225 Difference]: With dead ends: 1605907 [2018-10-26 20:06:52,653 INFO L226 Difference]: Without dead ends: 991798 [2018-10-26 20:06:52,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:06:53,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991798 states. [2018-10-26 20:07:07,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991798 to 987270. [2018-10-26 20:07:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987270 states. [2018-10-26 20:07:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987270 states to 987270 states and 1116482 transitions. [2018-10-26 20:07:10,716 INFO L78 Accepts]: Start accepts. Automaton has 987270 states and 1116482 transitions. Word has length 423 [2018-10-26 20:07:10,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:10,716 INFO L481 AbstractCegarLoop]: Abstraction has 987270 states and 1116482 transitions. [2018-10-26 20:07:10,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:07:10,717 INFO L276 IsEmpty]: Start isEmpty. Operand 987270 states and 1116482 transitions. [2018-10-26 20:07:10,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-10-26 20:07:10,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:10,895 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:07:10,895 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:10,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:10,896 INFO L82 PathProgramCache]: Analyzing trace with hash -962808791, now seen corresponding path program 1 times [2018-10-26 20:07:10,896 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:07:10,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:07:10,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:10,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:10,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-10-26 20:07:11,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:11,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:07:11,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:07:11,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:07:11,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:07:11,195 INFO L87 Difference]: Start difference. First operand 987270 states and 1116482 transitions. Second operand 3 states. [2018-10-26 20:07:33,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:33,743 INFO L93 Difference]: Finished difference Result 2494727 states and 2808160 transitions. [2018-10-26 20:07:33,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:07:33,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 440 [2018-10-26 20:07:33,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:36,464 INFO L225 Difference]: With dead ends: 2494727 [2018-10-26 20:07:36,464 INFO L226 Difference]: Without dead ends: 1507459 [2018-10-26 20:07:37,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:07:38,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507459 states.