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_label36_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 18:55:18,207 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 18:55:18,209 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 18:55:18,220 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 18:55:18,221 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 18:55:18,222 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 18:55:18,223 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 18:55:18,225 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 18:55:18,228 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 18:55:18,229 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 18:55:18,231 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 18:55:18,231 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 18:55:18,231 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 18:55:18,232 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 18:55:18,234 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 18:55:18,234 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 18:55:18,235 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 18:55:18,237 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 18:55:18,239 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 18:55:18,241 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 18:55:18,242 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 18:55:18,243 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 18:55:18,246 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 18:55:18,246 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 18:55:18,247 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 18:55:18,248 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 18:55:18,249 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 18:55:18,250 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 18:55:18,250 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 18:55:18,251 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 18:55:18,252 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 18:55:18,252 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 18:55:18,253 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 18:55:18,253 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 18:55:18,254 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 18:55:18,255 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 18:55:18,255 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 18:55:18,270 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 18:55:18,270 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 18:55:18,271 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 18:55:18,271 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 18:55:18,272 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 18:55:18,272 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 18:55:18,272 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 18:55:18,273 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 18:55:18,273 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 18:55:18,273 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 18:55:18,273 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 18:55:18,273 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 18:55:18,274 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 18:55:18,274 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 18:55:18,274 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 18:55:18,274 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 18:55:18,274 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 18:55:18,275 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 18:55:18,275 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 18:55:18,275 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:55:18,275 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 18:55:18,275 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 18:55:18,276 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 18:55:18,276 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 18:55:18,276 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 18:55:18,276 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 18:55:18,276 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 18:55:18,277 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 18:55:18,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 18:55:18,350 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 18:55:18,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 18:55:18,355 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 18:55:18,356 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 18:55:18,356 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label36_true-unreach-call.c [2018-10-23 18:55:18,423 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1e340db09/4998cdc6334048519037917b1a3a40bb/FLAG50f5b2ced [2018-10-23 18:55:19,037 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 18:55:19,038 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label36_true-unreach-call.c [2018-10-23 18:55:19,061 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1e340db09/4998cdc6334048519037917b1a3a40bb/FLAG50f5b2ced [2018-10-23 18:55:19,084 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1e340db09/4998cdc6334048519037917b1a3a40bb [2018-10-23 18:55:19,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 18:55:19,100 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 18:55:19,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 18:55:19,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 18:55:19,107 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 18:55:19,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:55:19" (1/1) ... [2018-10-23 18:55:19,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1597294d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:19, skipping insertion in model container [2018-10-23 18:55:19,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:55:19" (1/1) ... [2018-10-23 18:55:19,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 18:55:19,231 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 18:55:19,976 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:55:19,981 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 18:55:20,214 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:55:20,255 INFO L193 MainTranslator]: Completed translation [2018-10-23 18:55:20,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:20 WrapperNode [2018-10-23 18:55:20,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 18:55:20,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 18:55:20,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 18:55:20,258 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 18:55:20,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:20" (1/1) ... [2018-10-23 18:55:20,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:20" (1/1) ... [2018-10-23 18:55:20,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 18:55:20,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 18:55:20,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 18:55:20,558 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 18:55:20,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:20" (1/1) ... [2018-10-23 18:55:20,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:20" (1/1) ... [2018-10-23 18:55:20,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:20" (1/1) ... [2018-10-23 18:55:20,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:20" (1/1) ... [2018-10-23 18:55:20,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:20" (1/1) ... [2018-10-23 18:55:20,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:20" (1/1) ... [2018-10-23 18:55:20,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:20" (1/1) ... [2018-10-23 18:55:20,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 18:55:20,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 18:55:20,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 18:55:20,697 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 18:55:20,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:55:20,767 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 18:55:20,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 18:55:20,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 18:55:26,559 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 18:55:26,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:55:26 BoogieIcfgContainer [2018-10-23 18:55:26,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 18:55:26,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 18:55:26,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 18:55:26,566 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 18:55:26,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:55:19" (1/3) ... [2018-10-23 18:55:26,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32413296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:55:26, skipping insertion in model container [2018-10-23 18:55:26,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:20" (2/3) ... [2018-10-23 18:55:26,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32413296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:55:26, skipping insertion in model container [2018-10-23 18:55:26,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:55:26" (3/3) ... [2018-10-23 18:55:26,570 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label36_true-unreach-call.c [2018-10-23 18:55:26,582 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 18:55:26,592 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 18:55:26,611 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 18:55:26,650 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 18:55:26,651 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 18:55:26,651 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 18:55:26,651 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 18:55:26,651 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 18:55:26,652 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 18:55:26,652 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 18:55:26,652 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 18:55:26,652 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 18:55:26,680 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-23 18:55:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-23 18:55:26,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:26,710 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] [2018-10-23 18:55:26,713 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:26,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:26,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1071522756, now seen corresponding path program 1 times [2018-10-23 18:55:26,721 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:26,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:26,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:26,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:26,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:27,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:55:27,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:55:27,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:55:27,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:55:27,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:55:27,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:55:27,730 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-23 18:55:31,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:31,253 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-10-23 18:55:31,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:55:31,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-10-23 18:55:31,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:31,281 INFO L225 Difference]: With dead ends: 1075 [2018-10-23 18:55:31,281 INFO L226 Difference]: Without dead ends: 765 [2018-10-23 18:55:31,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:55:31,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-10-23 18:55:31,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-10-23 18:55:31,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-23 18:55:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-10-23 18:55:31,370 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 180 [2018-10-23 18:55:31,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:31,371 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-10-23 18:55:31,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:55:31,371 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-10-23 18:55:31,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-23 18:55:31,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:31,379 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] [2018-10-23 18:55:31,379 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:31,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:31,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1664876221, now seen corresponding path program 1 times [2018-10-23 18:55:31,380 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:31,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:31,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:31,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:31,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:31,503 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:55:31,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:55:31,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:55:31,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:55:31,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:55:31,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:55:31,507 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-10-23 18:55:33,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:33,795 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-10-23 18:55:33,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:55:33,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-10-23 18:55:33,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:33,803 INFO L225 Difference]: With dead ends: 1465 [2018-10-23 18:55:33,803 INFO L226 Difference]: Without dead ends: 947 [2018-10-23 18:55:33,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:55:33,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-10-23 18:55:33,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-10-23 18:55:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-10-23 18:55:33,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-10-23 18:55:33,848 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 189 [2018-10-23 18:55:33,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:33,849 INFO L481 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-10-23 18:55:33,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:55:33,849 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-10-23 18:55:33,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-23 18:55:33,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:33,854 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:55:33,854 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:33,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:33,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1680988393, now seen corresponding path program 1 times [2018-10-23 18:55:33,855 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:33,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:33,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:33,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:33,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:55:34,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:55:34,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:55:34,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:55:34,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:55:34,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:55:34,135 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-10-23 18:55:37,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:37,622 INFO L93 Difference]: Finished difference Result 2693 states and 4423 transitions. [2018-10-23 18:55:37,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:55:37,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2018-10-23 18:55:37,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:37,633 INFO L225 Difference]: With dead ends: 2693 [2018-10-23 18:55:37,633 INFO L226 Difference]: Without dead ends: 1764 [2018-10-23 18:55:37,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:55:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-10-23 18:55:37,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1748. [2018-10-23 18:55:37,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1748 states. [2018-10-23 18:55:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2752 transitions. [2018-10-23 18:55:37,679 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2752 transitions. Word has length 197 [2018-10-23 18:55:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:37,680 INFO L481 AbstractCegarLoop]: Abstraction has 1748 states and 2752 transitions. [2018-10-23 18:55:37,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:55:37,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2752 transitions. [2018-10-23 18:55:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-23 18:55:37,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:37,687 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:55:37,687 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:37,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:37,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1712813493, now seen corresponding path program 1 times [2018-10-23 18:55:37,688 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:37,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:37,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:37,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:37,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:37,823 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:55:37,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:55:37,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:55:37,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:55:37,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:55:37,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:55:37,825 INFO L87 Difference]: Start difference. First operand 1748 states and 2752 transitions. Second operand 3 states. [2018-10-23 18:55:39,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:39,403 INFO L93 Difference]: Finished difference Result 5132 states and 8130 transitions. [2018-10-23 18:55:39,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:55:39,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-10-23 18:55:39,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:39,423 INFO L225 Difference]: With dead ends: 5132 [2018-10-23 18:55:39,423 INFO L226 Difference]: Without dead ends: 3386 [2018-10-23 18:55:39,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:55:39,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2018-10-23 18:55:39,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3385. [2018-10-23 18:55:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2018-10-23 18:55:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4962 transitions. [2018-10-23 18:55:39,511 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4962 transitions. Word has length 204 [2018-10-23 18:55:39,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:39,511 INFO L481 AbstractCegarLoop]: Abstraction has 3385 states and 4962 transitions. [2018-10-23 18:55:39,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:55:39,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4962 transitions. [2018-10-23 18:55:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-23 18:55:39,522 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:39,523 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:55:39,523 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:39,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:39,523 INFO L82 PathProgramCache]: Analyzing trace with hash -634898385, now seen corresponding path program 1 times [2018-10-23 18:55:39,524 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:39,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:39,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:39,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:39,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:39,750 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-23 18:55:39,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:55:39,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:55:39,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:55:39,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:55:39,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:55:39,752 INFO L87 Difference]: Start difference. First operand 3385 states and 4962 transitions. Second operand 3 states. [2018-10-23 18:55:41,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:41,418 INFO L93 Difference]: Finished difference Result 10035 states and 14750 transitions. [2018-10-23 18:55:41,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:55:41,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-10-23 18:55:41,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:41,449 INFO L225 Difference]: With dead ends: 10035 [2018-10-23 18:55:41,449 INFO L226 Difference]: Without dead ends: 6652 [2018-10-23 18:55:41,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:55:41,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6652 states. [2018-10-23 18:55:41,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6652 to 6649. [2018-10-23 18:55:41,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-10-23 18:55:41,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8832 transitions. [2018-10-23 18:55:41,586 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8832 transitions. Word has length 211 [2018-10-23 18:55:41,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:41,586 INFO L481 AbstractCegarLoop]: Abstraction has 6649 states and 8832 transitions. [2018-10-23 18:55:41,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:55:41,586 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8832 transitions. [2018-10-23 18:55:41,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-23 18:55:41,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:41,602 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:55:41,602 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:41,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:41,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1018946693, now seen corresponding path program 1 times [2018-10-23 18:55:41,603 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:41,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:41,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:41,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:41,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:41,952 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:55:41,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:55:41,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:55:41,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:55:41,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:55:41,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:55:41,954 INFO L87 Difference]: Start difference. First operand 6649 states and 8832 transitions. Second operand 4 states. [2018-10-23 18:55:44,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:44,480 INFO L93 Difference]: Finished difference Result 13297 states and 17664 transitions. [2018-10-23 18:55:44,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:55:44,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2018-10-23 18:55:44,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:44,505 INFO L225 Difference]: With dead ends: 13297 [2018-10-23 18:55:44,505 INFO L226 Difference]: Without dead ends: 6650 [2018-10-23 18:55:44,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:55:44,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6650 states. [2018-10-23 18:55:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6650 to 6649. [2018-10-23 18:55:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-10-23 18:55:44,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8345 transitions. [2018-10-23 18:55:44,632 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8345 transitions. Word has length 211 [2018-10-23 18:55:44,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:44,632 INFO L481 AbstractCegarLoop]: Abstraction has 6649 states and 8345 transitions. [2018-10-23 18:55:44,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:55:44,633 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8345 transitions. [2018-10-23 18:55:44,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-23 18:55:44,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:44,647 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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-23 18:55:44,648 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:44,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:44,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1841420693, now seen corresponding path program 1 times [2018-10-23 18:55:44,648 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:44,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:44,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:44,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:44,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:44,798 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-23 18:55:44,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:55:44,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:55:44,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:55:44,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:55:44,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:55:44,800 INFO L87 Difference]: Start difference. First operand 6649 states and 8345 transitions. Second operand 3 states. [2018-10-23 18:55:45,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:45,614 INFO L93 Difference]: Finished difference Result 13264 states and 16645 transitions. [2018-10-23 18:55:45,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:55:45,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-10-23 18:55:45,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:45,641 INFO L225 Difference]: With dead ends: 13264 [2018-10-23 18:55:45,642 INFO L226 Difference]: Without dead ends: 6617 [2018-10-23 18:55:45,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:55:45,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2018-10-23 18:55:45,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 6617. [2018-10-23 18:55:45,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6617 states. [2018-10-23 18:55:45,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6617 states to 6617 states and 8118 transitions. [2018-10-23 18:55:45,753 INFO L78 Accepts]: Start accepts. Automaton has 6617 states and 8118 transitions. Word has length 218 [2018-10-23 18:55:45,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:45,754 INFO L481 AbstractCegarLoop]: Abstraction has 6617 states and 8118 transitions. [2018-10-23 18:55:45,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:55:45,754 INFO L276 IsEmpty]: Start isEmpty. Operand 6617 states and 8118 transitions. [2018-10-23 18:55:45,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-23 18:55:45,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:45,772 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:55:45,772 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:45,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:45,772 INFO L82 PathProgramCache]: Analyzing trace with hash -197633740, now seen corresponding path program 1 times [2018-10-23 18:55:45,773 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:45,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:45,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:45,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:45,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:55:46,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:55:46,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:55:46,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:55:46,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:55:46,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:55:46,095 INFO L87 Difference]: Start difference. First operand 6617 states and 8118 transitions. Second operand 3 states. [2018-10-23 18:55:47,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:47,561 INFO L93 Difference]: Finished difference Result 15690 states and 19149 transitions. [2018-10-23 18:55:47,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:55:47,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2018-10-23 18:55:47,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:47,582 INFO L225 Difference]: With dead ends: 15690 [2018-10-23 18:55:47,582 INFO L226 Difference]: Without dead ends: 9075 [2018-10-23 18:55:47,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:55:47,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9075 states. [2018-10-23 18:55:47,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9075 to 9074. [2018-10-23 18:55:47,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9074 states. [2018-10-23 18:55:47,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9074 states to 9074 states and 10935 transitions. [2018-10-23 18:55:47,723 INFO L78 Accepts]: Start accepts. Automaton has 9074 states and 10935 transitions. Word has length 222 [2018-10-23 18:55:47,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:47,723 INFO L481 AbstractCegarLoop]: Abstraction has 9074 states and 10935 transitions. [2018-10-23 18:55:47,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:55:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 9074 states and 10935 transitions. [2018-10-23 18:55:47,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-23 18:55:47,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:47,739 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] [2018-10-23 18:55:47,739 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:47,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:47,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1273676320, now seen corresponding path program 1 times [2018-10-23 18:55:47,740 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:47,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:47,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:47,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:47,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:48,177 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-23 18:55:48,253 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-23 18:55:48,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:55:48,253 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:55:48,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:48,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:55:48,599 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-23 18:55:48,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:55:48,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-23 18:55:48,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 18:55:48,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 18:55:48,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-23 18:55:48,637 INFO L87 Difference]: Start difference. First operand 9074 states and 10935 transitions. Second operand 7 states. [2018-10-23 18:55:53,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:53,354 INFO L93 Difference]: Finished difference Result 34490 states and 42017 transitions. [2018-10-23 18:55:53,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 18:55:53,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 230 [2018-10-23 18:55:53,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:53,405 INFO L225 Difference]: With dead ends: 34490 [2018-10-23 18:55:53,405 INFO L226 Difference]: Without dead ends: 25418 [2018-10-23 18:55:53,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-10-23 18:55:53,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25418 states. [2018-10-23 18:55:53,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25418 to 25412. [2018-10-23 18:55:53,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25412 states. [2018-10-23 18:55:53,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25412 states to 25412 states and 28705 transitions. [2018-10-23 18:55:53,771 INFO L78 Accepts]: Start accepts. Automaton has 25412 states and 28705 transitions. Word has length 230 [2018-10-23 18:55:53,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:53,771 INFO L481 AbstractCegarLoop]: Abstraction has 25412 states and 28705 transitions. [2018-10-23 18:55:53,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 18:55:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 25412 states and 28705 transitions. [2018-10-23 18:55:53,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-10-23 18:55:53,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:53,812 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:55:53,813 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:53,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:53,813 INFO L82 PathProgramCache]: Analyzing trace with hash 582135979, now seen corresponding path program 1 times [2018-10-23 18:55:53,814 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:53,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:53,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:53,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:53,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:54,264 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-23 18:55:54,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:55:54,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:55:54,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:55:54,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:55:54,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:55:54,266 INFO L87 Difference]: Start difference. First operand 25412 states and 28705 transitions. Second operand 4 states. [2018-10-23 18:55:56,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:56,582 INFO L93 Difference]: Finished difference Result 50218 states and 56784 transitions. [2018-10-23 18:55:56,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:55:56,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 321 [2018-10-23 18:55:56,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:56,627 INFO L225 Difference]: With dead ends: 50218 [2018-10-23 18:55:56,628 INFO L226 Difference]: Without dead ends: 24808 [2018-10-23 18:55:56,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:55:56,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24808 states. [2018-10-23 18:55:56,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24808 to 24797. [2018-10-23 18:55:56,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24797 states. [2018-10-23 18:55:56,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24797 states to 24797 states and 27813 transitions. [2018-10-23 18:55:56,993 INFO L78 Accepts]: Start accepts. Automaton has 24797 states and 27813 transitions. Word has length 321 [2018-10-23 18:55:56,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:56,993 INFO L481 AbstractCegarLoop]: Abstraction has 24797 states and 27813 transitions. [2018-10-23 18:55:56,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:55:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 24797 states and 27813 transitions. [2018-10-23 18:55:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-23 18:55:57,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:57,028 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:55:57,029 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:57,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:57,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1125602268, now seen corresponding path program 1 times [2018-10-23 18:55:57,029 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:57,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:57,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:57,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:57,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-10-23 18:55:57,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:55:57,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:55:57,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:55:57,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:55:57,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:55:57,443 INFO L87 Difference]: Start difference. First operand 24797 states and 27813 transitions. Second operand 4 states. [2018-10-23 18:55:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:59,820 INFO L93 Difference]: Finished difference Result 51849 states and 58266 transitions. [2018-10-23 18:55:59,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:55:59,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 342 [2018-10-23 18:55:59,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:59,860 INFO L225 Difference]: With dead ends: 51849 [2018-10-23 18:55:59,861 INFO L226 Difference]: Without dead ends: 27054 [2018-10-23 18:55:59,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:55:59,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27054 states. [2018-10-23 18:56:00,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27054 to 27047. [2018-10-23 18:56:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27047 states. [2018-10-23 18:56:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27047 states to 27047 states and 30335 transitions. [2018-10-23 18:56:00,250 INFO L78 Accepts]: Start accepts. Automaton has 27047 states and 30335 transitions. Word has length 342 [2018-10-23 18:56:00,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:56:00,251 INFO L481 AbstractCegarLoop]: Abstraction has 27047 states and 30335 transitions. [2018-10-23 18:56:00,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:56:00,251 INFO L276 IsEmpty]: Start isEmpty. Operand 27047 states and 30335 transitions. [2018-10-23 18:56:00,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-10-23 18:56:00,283 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:56:00,283 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:56:00,283 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:56:00,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:56:00,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1562798004, now seen corresponding path program 1 times [2018-10-23 18:56:00,284 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:56:00,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:56:00,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:00,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:00,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-10-23 18:56:00,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:56:00,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:56:00,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:56:00,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:56:00,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:56:00,554 INFO L87 Difference]: Start difference. First operand 27047 states and 30335 transitions. Second operand 3 states. [2018-10-23 18:56:02,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:56:02,089 INFO L93 Difference]: Finished difference Result 52660 states and 59076 transitions. [2018-10-23 18:56:02,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:56:02,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 363 [2018-10-23 18:56:02,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:56:02,123 INFO L225 Difference]: With dead ends: 52660 [2018-10-23 18:56:02,123 INFO L226 Difference]: Without dead ends: 25615 [2018-10-23 18:56:02,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:56:02,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25615 states. [2018-10-23 18:56:02,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25615 to 25612. [2018-10-23 18:56:02,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25612 states. [2018-10-23 18:56:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25612 states to 25612 states and 28117 transitions. [2018-10-23 18:56:02,453 INFO L78 Accepts]: Start accepts. Automaton has 25612 states and 28117 transitions. Word has length 363 [2018-10-23 18:56:02,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:56:02,454 INFO L481 AbstractCegarLoop]: Abstraction has 25612 states and 28117 transitions. [2018-10-23 18:56:02,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:56:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 25612 states and 28117 transitions. [2018-10-23 18:56:02,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-10-23 18:56:02,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:56:02,477 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:56:02,478 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:56:02,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:56:02,478 INFO L82 PathProgramCache]: Analyzing trace with hash -921422517, now seen corresponding path program 1 times [2018-10-23 18:56:02,478 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:56:02,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:56:02,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:02,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:02,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:02,967 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 18:56:03,354 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-23 18:56:03,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:56:03,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:56:03,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:56:03,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:56:03,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:56:03,357 INFO L87 Difference]: Start difference. First operand 25612 states and 28117 transitions. Second operand 4 states. [2018-10-23 18:56:04,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:56:04,400 INFO L93 Difference]: Finished difference Result 99169 states and 109018 transitions. [2018-10-23 18:56:04,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:56:04,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 370 [2018-10-23 18:56:04,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:56:04,490 INFO L225 Difference]: With dead ends: 99169 [2018-10-23 18:56:04,491 INFO L226 Difference]: Without dead ends: 73559 [2018-10-23 18:56:04,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:56:04,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73559 states. [2018-10-23 18:56:05,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73559 to 48356. [2018-10-23 18:56:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48356 states. [2018-10-23 18:56:05,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48356 states to 48356 states and 53197 transitions. [2018-10-23 18:56:05,259 INFO L78 Accepts]: Start accepts. Automaton has 48356 states and 53197 transitions. Word has length 370 [2018-10-23 18:56:05,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:56:05,259 INFO L481 AbstractCegarLoop]: Abstraction has 48356 states and 53197 transitions. [2018-10-23 18:56:05,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:56:05,260 INFO L276 IsEmpty]: Start isEmpty. Operand 48356 states and 53197 transitions. [2018-10-23 18:56:05,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-10-23 18:56:05,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:56:05,284 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:56:05,285 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:56:05,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:56:05,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1816538621, now seen corresponding path program 1 times [2018-10-23 18:56:05,285 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:56:05,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:56:05,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:05,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:05,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:05,829 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-23 18:56:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2018-10-23 18:56:05,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:56:05,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:56:05,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:56:05,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:56:05,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:56:05,938 INFO L87 Difference]: Start difference. First operand 48356 states and 53197 transitions. Second operand 5 states. [2018-10-23 18:56:08,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:56:08,449 INFO L93 Difference]: Finished difference Result 134847 states and 148793 transitions. [2018-10-23 18:56:08,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:56:08,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 373 [2018-10-23 18:56:08,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:56:08,543 INFO L225 Difference]: With dead ends: 134847 [2018-10-23 18:56:08,543 INFO L226 Difference]: Without dead ends: 86493 [2018-10-23 18:56:08,583 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-23 18:56:08,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86493 states. [2018-10-23 18:56:09,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86493 to 84417. [2018-10-23 18:56:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84417 states. [2018-10-23 18:56:09,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84417 states to 84417 states and 92902 transitions. [2018-10-23 18:56:09,932 INFO L78 Accepts]: Start accepts. Automaton has 84417 states and 92902 transitions. Word has length 373 [2018-10-23 18:56:09,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:56:09,933 INFO L481 AbstractCegarLoop]: Abstraction has 84417 states and 92902 transitions. [2018-10-23 18:56:09,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:56:09,933 INFO L276 IsEmpty]: Start isEmpty. Operand 84417 states and 92902 transitions. [2018-10-23 18:56:09,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-10-23 18:56:09,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:56:09,970 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:56:09,970 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:56:09,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:56:09,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1602254634, now seen corresponding path program 1 times [2018-10-23 18:56:09,971 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:56:09,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:56:09,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:09,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:09,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:10,387 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-23 18:56:10,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:56:10,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:56:10,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:56:10,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:56:10,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:56:10,390 INFO L87 Difference]: Start difference. First operand 84417 states and 92902 transitions. Second operand 3 states. [2018-10-23 18:56:12,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:56:12,353 INFO L93 Difference]: Finished difference Result 199174 states and 218905 transitions. [2018-10-23 18:56:12,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:56:12,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2018-10-23 18:56:12,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:56:12,483 INFO L225 Difference]: With dead ends: 199174 [2018-10-23 18:56:12,483 INFO L226 Difference]: Without dead ends: 114759 [2018-10-23 18:56:12,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:56:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114759 states. [2018-10-23 18:56:14,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114759 to 114759. [2018-10-23 18:56:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114759 states. [2018-10-23 18:56:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114759 states to 114759 states and 125859 transitions. [2018-10-23 18:56:14,622 INFO L78 Accepts]: Start accepts. Automaton has 114759 states and 125859 transitions. Word has length 392 [2018-10-23 18:56:14,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:56:14,623 INFO L481 AbstractCegarLoop]: Abstraction has 114759 states and 125859 transitions. [2018-10-23 18:56:14,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:56:14,623 INFO L276 IsEmpty]: Start isEmpty. Operand 114759 states and 125859 transitions. [2018-10-23 18:56:14,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2018-10-23 18:56:14,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:56:14,702 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-23 18:56:14,703 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:56:14,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:56:14,703 INFO L82 PathProgramCache]: Analyzing trace with hash 593917864, now seen corresponding path program 1 times [2018-10-23 18:56:14,703 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:56:14,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:56:14,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:14,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:14,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 709 trivial. 0 not checked. [2018-10-23 18:56:15,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:56:15,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:56:15,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:56:15,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:56:15,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:56:15,271 INFO L87 Difference]: Start difference. First operand 114759 states and 125859 transitions. Second operand 3 states. [2018-10-23 18:56:16,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:56:16,431 INFO L93 Difference]: Finished difference Result 309033 states and 338482 transitions. [2018-10-23 18:56:16,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:56:16,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 693 [2018-10-23 18:56:16,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:56:16,708 INFO L225 Difference]: With dead ends: 309033 [2018-10-23 18:56:16,708 INFO L226 Difference]: Without dead ends: 194276 [2018-10-23 18:56:16,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:56:17,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194276 states. [2018-10-23 18:56:20,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194276 to 194274. [2018-10-23 18:56:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194274 states. [2018-10-23 18:56:20,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194274 states to 194274 states and 211398 transitions. [2018-10-23 18:56:20,744 INFO L78 Accepts]: Start accepts. Automaton has 194274 states and 211398 transitions. Word has length 693 [2018-10-23 18:56:20,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:56:20,745 INFO L481 AbstractCegarLoop]: Abstraction has 194274 states and 211398 transitions. [2018-10-23 18:56:20,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:56:20,745 INFO L276 IsEmpty]: Start isEmpty. Operand 194274 states and 211398 transitions. [2018-10-23 18:56:20,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2018-10-23 18:56:20,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:56:20,852 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-23 18:56:20,853 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:56:20,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:56:20,853 INFO L82 PathProgramCache]: Analyzing trace with hash 374868588, now seen corresponding path program 1 times [2018-10-23 18:56:20,853 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:56:20,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:56:20,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:20,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:20,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:21,484 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-23 18:56:21,711 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-23 18:56:22,013 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-23 18:56:22,202 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-23 18:56:22,520 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-23 18:56:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1447 backedges. 732 proven. 29 refuted. 0 times theorem prover too weak. 686 trivial. 0 not checked. [2018-10-23 18:56:24,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:56:24,723 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:56:24,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:25,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:56:25,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1447 backedges. 510 proven. 0 refuted. 0 times theorem prover too weak. 937 trivial. 0 not checked. [2018-10-23 18:56:25,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:56:25,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2018-10-23 18:56:25,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-23 18:56:25,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-23 18:56:25,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-10-23 18:56:25,489 INFO L87 Difference]: Start difference. First operand 194274 states and 211398 transitions. Second operand 11 states. [2018-10-23 18:56:54,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:56:54,580 INFO L93 Difference]: Finished difference Result 1596964 states and 1736457 transitions. [2018-10-23 18:56:54,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-23 18:56:54,581 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 695 [2018-10-23 18:56:54,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:56:57,560 INFO L225 Difference]: With dead ends: 1596964 [2018-10-23 18:56:57,561 INFO L226 Difference]: Without dead ends: 1402680 [2018-10-23 18:56:57,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 694 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-23 18:56:59,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402680 states. [2018-10-23 18:57:16,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402680 to 1317555. [2018-10-23 18:57:16,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317555 states. [2018-10-23 18:57:35,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317555 states to 1317555 states and 1434262 transitions. [2018-10-23 18:57:35,268 INFO L78 Accepts]: Start accepts. Automaton has 1317555 states and 1434262 transitions. Word has length 695 [2018-10-23 18:57:35,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:35,269 INFO L481 AbstractCegarLoop]: Abstraction has 1317555 states and 1434262 transitions. [2018-10-23 18:57:35,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-23 18:57:35,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1317555 states and 1434262 transitions. [2018-10-23 18:57:38,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 800 [2018-10-23 18:57:38,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:38,508 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:57:38,509 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:38,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:38,509 INFO L82 PathProgramCache]: Analyzing trace with hash 460198062, now seen corresponding path program 1 times [2018-10-23 18:57:38,509 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:38,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:38,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:38,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:38,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:39,424 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-23 18:57:39,679 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-23 18:57:39,873 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-23 18:57:40,168 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-23 18:57:40,520 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-23 18:57:41,137 WARN L179 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2018-10-23 18:57:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2121 backedges. 966 proven. 40 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2018-10-23 18:57:42,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:57:42,773 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-23 18:57:42,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:43,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:57:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2121 backedges. 1143 proven. 0 refuted. 0 times theorem prover too weak. 978 trivial. 0 not checked. [2018-10-23 18:57:43,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:57:43,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-10-23 18:57:43,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-23 18:57:43,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-23 18:57:43,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-10-23 18:57:43,739 INFO L87 Difference]: Start difference. First operand 1317555 states and 1434262 transitions. Second operand 14 states.