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_label11_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:58:17,514 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:58:17,516 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:58:17,537 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:58:17,537 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:58:17,539 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:58:17,541 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:58:17,544 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:58:17,547 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:58:17,560 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:58:17,561 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:58:17,561 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:58:17,562 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:58:17,563 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:58:17,565 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:58:17,565 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:58:17,569 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:58:17,570 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:58:17,574 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:58:17,578 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:58:17,579 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:58:17,585 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:58:17,589 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:58:17,590 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:58:17,590 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:58:17,591 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:58:17,594 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:58:17,595 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:58:17,596 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:58:17,600 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:58:17,601 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:58:17,601 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:58:17,604 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:58:17,604 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:58:17,605 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:58:17,606 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:58:17,606 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 19:58:17,625 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:58:17,625 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:58:17,626 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:58:17,627 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:58:17,627 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:58:17,627 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:58:17,628 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 19:58:17,628 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:58:17,628 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:58:17,628 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:58:17,629 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:58:17,629 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:58:17,629 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:58:17,629 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:58:17,629 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:58:17,629 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:58:17,630 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:58:17,630 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:58:17,630 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:58:17,630 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:58:17,631 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:58:17,631 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:58:17,631 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:58:17,631 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 19:58:17,631 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:58:17,631 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:58:17,632 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:58:17,632 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 19:58:17,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:58:17,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:58:17,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:58:17,699 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:58:17,699 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:58:17,700 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label11_true-unreach-call.c [2018-10-26 19:58:17,760 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b2274af1d/c3e12a3e0dd84026ab4cd3978d105fe7/FLAG3e0369bc1 [2018-10-26 19:58:18,389 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:58:18,390 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label11_true-unreach-call.c [2018-10-26 19:58:18,413 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b2274af1d/c3e12a3e0dd84026ab4cd3978d105fe7/FLAG3e0369bc1 [2018-10-26 19:58:18,433 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b2274af1d/c3e12a3e0dd84026ab4cd3978d105fe7 [2018-10-26 19:58:18,446 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:58:18,447 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 19:58:18,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:58:18,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:58:18,452 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:58:18,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:58:18" (1/1) ... [2018-10-26 19:58:18,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cd04aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:18, skipping insertion in model container [2018-10-26 19:58:18,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:58:18" (1/1) ... [2018-10-26 19:58:18,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:58:18,552 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:58:19,326 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:58:19,333 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:58:19,612 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:58:19,638 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:58:19,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:19 WrapperNode [2018-10-26 19:58:19,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:58:19,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:58:19,641 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:58:19,642 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:58:19,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:19" (1/1) ... [2018-10-26 19:58:19,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:19" (1/1) ... [2018-10-26 19:58:19,927 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:58:19,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:58:19,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:58:19,928 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:58:19,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:19" (1/1) ... [2018-10-26 19:58:19,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:19" (1/1) ... [2018-10-26 19:58:19,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:19" (1/1) ... [2018-10-26 19:58:19,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:19" (1/1) ... [2018-10-26 19:58:20,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:19" (1/1) ... [2018-10-26 19:58:20,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:19" (1/1) ... [2018-10-26 19:58:20,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:19" (1/1) ... [2018-10-26 19:58:20,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:58:20,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:58:20,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:58:20,073 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:58:20,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:58:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:58:20,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:58:20,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:58:26,042 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:58:26,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:58:26 BoogieIcfgContainer [2018-10-26 19:58:26,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:58:26,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:58:26,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:58:26,047 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:58:26,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:58:18" (1/3) ... [2018-10-26 19:58:26,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a438c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:58:26, skipping insertion in model container [2018-10-26 19:58:26,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:19" (2/3) ... [2018-10-26 19:58:26,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a438c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:58:26, skipping insertion in model container [2018-10-26 19:58:26,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:58:26" (3/3) ... [2018-10-26 19:58:26,051 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label11_true-unreach-call.c [2018-10-26 19:58:26,062 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:58:26,072 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:58:26,091 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:58:26,130 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:58:26,131 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:58:26,131 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:58:26,132 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:58:26,132 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:58:26,132 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:58:26,132 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:58:26,132 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:58:26,132 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:58:26,158 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-26 19:58:26,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-26 19:58:26,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:26,188 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:26,193 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:26,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:26,199 INFO L82 PathProgramCache]: Analyzing trace with hash -73727940, now seen corresponding path program 1 times [2018-10-26 19:58:26,201 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:26,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:26,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:26,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:26,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:27,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:27,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:27,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:27,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:27,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:27,149 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-26 19:58:30,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:30,944 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-10-26 19:58:30,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:30,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2018-10-26 19:58:30,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:30,974 INFO L225 Difference]: With dead ends: 1027 [2018-10-26 19:58:30,974 INFO L226 Difference]: Without dead ends: 717 [2018-10-26 19:58:30,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:31,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-26 19:58:31,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-10-26 19:58:31,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-26 19:58:31,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-10-26 19:58:31,078 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 194 [2018-10-26 19:58:31,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:31,079 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-10-26 19:58:31,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:31,080 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-10-26 19:58:31,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-26 19:58:31,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:31,088 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:31,089 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:31,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:31,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1649660795, now seen corresponding path program 1 times [2018-10-26 19:58:31,089 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:31,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:31,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:31,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:31,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:31,236 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:31,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:31,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:31,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:31,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:31,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:31,240 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-10-26 19:58:33,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:33,625 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-10-26 19:58:33,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:33,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2018-10-26 19:58:33,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:33,635 INFO L225 Difference]: With dead ends: 2058 [2018-10-26 19:58:33,635 INFO L226 Difference]: Without dead ends: 1345 [2018-10-26 19:58:33,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:33,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-10-26 19:58:33,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-10-26 19:58:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-26 19:58:33,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-10-26 19:58:33,695 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 203 [2018-10-26 19:58:33,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:33,696 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-10-26 19:58:33,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:33,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-10-26 19:58:33,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-26 19:58:33,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:33,707 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:33,707 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:33,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:33,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1743599183, now seen corresponding path program 1 times [2018-10-26 19:58:33,708 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:33,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:33,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:33,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:33,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:34,042 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-26 19:58:34,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:34,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:34,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:34,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:34,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:34,044 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-10-26 19:58:37,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:37,463 INFO L93 Difference]: Finished difference Result 3891 states and 6117 transitions. [2018-10-26 19:58:37,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:37,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-10-26 19:58:37,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:37,480 INFO L225 Difference]: With dead ends: 3891 [2018-10-26 19:58:37,480 INFO L226 Difference]: Without dead ends: 2562 [2018-10-26 19:58:37,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:37,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2018-10-26 19:58:37,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2557. [2018-10-26 19:58:37,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2557 states. [2018-10-26 19:58:37,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 3774 transitions. [2018-10-26 19:58:37,545 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 3774 transitions. Word has length 211 [2018-10-26 19:58:37,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:37,546 INFO L481 AbstractCegarLoop]: Abstraction has 2557 states and 3774 transitions. [2018-10-26 19:58:37,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:37,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3774 transitions. [2018-10-26 19:58:37,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-26 19:58:37,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:37,554 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:37,554 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:37,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:37,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1812376770, now seen corresponding path program 1 times [2018-10-26 19:58:37,555 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:37,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:37,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:37,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:37,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:37,770 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:37,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:37,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:37,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:37,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:37,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:37,772 INFO L87 Difference]: Start difference. First operand 2557 states and 3774 transitions. Second operand 3 states. [2018-10-26 19:58:39,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:39,524 INFO L93 Difference]: Finished difference Result 6396 states and 9368 transitions. [2018-10-26 19:58:39,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:39,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2018-10-26 19:58:39,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:39,545 INFO L225 Difference]: With dead ends: 6396 [2018-10-26 19:58:39,545 INFO L226 Difference]: Without dead ends: 3841 [2018-10-26 19:58:39,550 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-26 19:58:39,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states. [2018-10-26 19:58:39,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 3837. [2018-10-26 19:58:39,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3837 states. [2018-10-26 19:58:39,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 5572 transitions. [2018-10-26 19:58:39,684 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 5572 transitions. Word has length 223 [2018-10-26 19:58:39,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:39,685 INFO L481 AbstractCegarLoop]: Abstraction has 3837 states and 5572 transitions. [2018-10-26 19:58:39,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:39,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 5572 transitions. [2018-10-26 19:58:39,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-26 19:58:39,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:39,696 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:39,696 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:39,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:39,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1480172138, now seen corresponding path program 1 times [2018-10-26 19:58:39,697 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:39,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:39,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:39,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:39,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:40,051 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 19:58:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:40,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:58:40,206 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:58:40,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:40,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:58:40,542 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-26 19:58:40,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:58:40,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-26 19:58:40,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:58:40,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:58:40,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:58:40,579 INFO L87 Difference]: Start difference. First operand 3837 states and 5572 transitions. Second operand 6 states. [2018-10-26 19:58:40,747 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-26 19:58:42,053 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 19:58:48,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:48,148 INFO L93 Difference]: Finished difference Result 25612 states and 37422 transitions. [2018-10-26 19:58:48,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 19:58:48,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 231 [2018-10-26 19:58:48,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:48,341 INFO L225 Difference]: With dead ends: 25612 [2018-10-26 19:58:48,341 INFO L226 Difference]: Without dead ends: 21777 [2018-10-26 19:58:48,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-26 19:58:48,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21777 states. [2018-10-26 19:58:48,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21777 to 21749. [2018-10-26 19:58:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21749 states. [2018-10-26 19:58:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21749 states to 21749 states and 28388 transitions. [2018-10-26 19:58:48,758 INFO L78 Accepts]: Start accepts. Automaton has 21749 states and 28388 transitions. Word has length 231 [2018-10-26 19:58:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:48,759 INFO L481 AbstractCegarLoop]: Abstraction has 21749 states and 28388 transitions. [2018-10-26 19:58:48,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:58:48,759 INFO L276 IsEmpty]: Start isEmpty. Operand 21749 states and 28388 transitions. [2018-10-26 19:58:48,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-26 19:58:48,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:48,804 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:48,805 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:48,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:48,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1458638854, now seen corresponding path program 1 times [2018-10-26 19:58:48,805 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:48,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:48,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:48,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:48,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:58:49,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:49,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:49,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:49,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:49,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:49,017 INFO L87 Difference]: Start difference. First operand 21749 states and 28388 transitions. Second operand 3 states. [2018-10-26 19:58:50,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:50,525 INFO L93 Difference]: Finished difference Result 43170 states and 56423 transitions. [2018-10-26 19:58:50,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:50,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2018-10-26 19:58:50,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:50,572 INFO L225 Difference]: With dead ends: 43170 [2018-10-26 19:58:50,572 INFO L226 Difference]: Without dead ends: 21423 [2018-10-26 19:58:50,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:50,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21423 states. [2018-10-26 19:58:50,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21423 to 21416. [2018-10-26 19:58:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21416 states. [2018-10-26 19:58:50,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21416 states to 21416 states and 26340 transitions. [2018-10-26 19:58:50,898 INFO L78 Accepts]: Start accepts. Automaton has 21416 states and 26340 transitions. Word has length 245 [2018-10-26 19:58:50,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:50,898 INFO L481 AbstractCegarLoop]: Abstraction has 21416 states and 26340 transitions. [2018-10-26 19:58:50,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:50,899 INFO L276 IsEmpty]: Start isEmpty. Operand 21416 states and 26340 transitions. [2018-10-26 19:58:50,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-26 19:58:50,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:50,942 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:58:50,943 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:50,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:50,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1653105828, now seen corresponding path program 1 times [2018-10-26 19:58:50,943 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:50,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:50,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:50,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:50,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-26 19:58:51,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:51,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:51,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:51,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:51,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:51,111 INFO L87 Difference]: Start difference. First operand 21416 states and 26340 transitions. Second operand 3 states. [2018-10-26 19:58:52,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:52,349 INFO L93 Difference]: Finished difference Result 42750 states and 52566 transitions. [2018-10-26 19:58:52,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:52,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-10-26 19:58:52,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:52,394 INFO L225 Difference]: With dead ends: 42750 [2018-10-26 19:58:52,394 INFO L226 Difference]: Without dead ends: 21336 [2018-10-26 19:58:52,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:52,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21336 states. [2018-10-26 19:58:52,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21336 to 20724. [2018-10-26 19:58:52,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20724 states. [2018-10-26 19:58:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20724 states to 20724 states and 25148 transitions. [2018-10-26 19:58:52,833 INFO L78 Accepts]: Start accepts. Automaton has 20724 states and 25148 transitions. Word has length 261 [2018-10-26 19:58:52,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:52,834 INFO L481 AbstractCegarLoop]: Abstraction has 20724 states and 25148 transitions. [2018-10-26 19:58:52,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:52,834 INFO L276 IsEmpty]: Start isEmpty. Operand 20724 states and 25148 transitions. [2018-10-26 19:58:52,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-26 19:58:52,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:52,860 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:52,860 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:52,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:52,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1354619751, now seen corresponding path program 1 times [2018-10-26 19:58:52,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:52,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:52,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:52,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:52,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:53,154 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:58:53,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:53,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:58:53,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:58:53,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:58:53,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:58:53,156 INFO L87 Difference]: Start difference. First operand 20724 states and 25148 transitions. Second operand 5 states. [2018-10-26 19:58:55,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:55,544 INFO L93 Difference]: Finished difference Result 69861 states and 84598 transitions. [2018-10-26 19:58:55,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:58:55,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 266 [2018-10-26 19:58:55,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:55,631 INFO L225 Difference]: With dead ends: 69861 [2018-10-26 19:58:55,631 INFO L226 Difference]: Without dead ends: 49139 [2018-10-26 19:58:55,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:58:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49139 states. [2018-10-26 19:58:56,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49139 to 47904. [2018-10-26 19:58:56,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47904 states. [2018-10-26 19:58:56,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47904 states to 47904 states and 56703 transitions. [2018-10-26 19:58:56,256 INFO L78 Accepts]: Start accepts. Automaton has 47904 states and 56703 transitions. Word has length 266 [2018-10-26 19:58:56,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:56,257 INFO L481 AbstractCegarLoop]: Abstraction has 47904 states and 56703 transitions. [2018-10-26 19:58:56,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:58:56,257 INFO L276 IsEmpty]: Start isEmpty. Operand 47904 states and 56703 transitions. [2018-10-26 19:58:56,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-26 19:58:56,283 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:56,284 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:56,284 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:56,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:56,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1278485182, now seen corresponding path program 1 times [2018-10-26 19:58:56,285 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:56,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:56,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:56,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:56,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:58:56,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:56,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:56,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:56,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:56,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:56,644 INFO L87 Difference]: Start difference. First operand 47904 states and 56703 transitions. Second operand 4 states. [2018-10-26 19:58:58,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:58,847 INFO L93 Difference]: Finished difference Result 126994 states and 149971 transitions. [2018-10-26 19:58:58,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:58,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 285 [2018-10-26 19:58:58,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:58,938 INFO L225 Difference]: With dead ends: 126994 [2018-10-26 19:58:58,939 INFO L226 Difference]: Without dead ends: 79092 [2018-10-26 19:58:58,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:59,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79092 states. [2018-10-26 19:58:59,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79092 to 77664. [2018-10-26 19:58:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77664 states. [2018-10-26 19:58:59,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77664 states to 77664 states and 88158 transitions. [2018-10-26 19:58:59,777 INFO L78 Accepts]: Start accepts. Automaton has 77664 states and 88158 transitions. Word has length 285 [2018-10-26 19:58:59,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:59,777 INFO L481 AbstractCegarLoop]: Abstraction has 77664 states and 88158 transitions. [2018-10-26 19:58:59,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:59,778 INFO L276 IsEmpty]: Start isEmpty. Operand 77664 states and 88158 transitions. [2018-10-26 19:58:59,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-10-26 19:58:59,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:59,810 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-26 19:58:59,810 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:59,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:59,810 INFO L82 PathProgramCache]: Analyzing trace with hash -310432137, now seen corresponding path program 1 times [2018-10-26 19:58:59,810 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:59,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:59,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:59,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:59,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:00,052 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-26 19:59:00,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:00,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:59:00,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:59:00,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:59:00,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:59:00,054 INFO L87 Difference]: Start difference. First operand 77664 states and 88158 transitions. Second operand 5 states. [2018-10-26 19:59:03,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:03,342 INFO L93 Difference]: Finished difference Result 200561 states and 228116 transitions. [2018-10-26 19:59:03,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:59:03,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 343 [2018-10-26 19:59:03,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:03,500 INFO L225 Difference]: With dead ends: 200561 [2018-10-26 19:59:03,500 INFO L226 Difference]: Without dead ends: 122899 [2018-10-26 19:59:03,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:59:03,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122899 states. [2018-10-26 19:59:04,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122899 to 120193. [2018-10-26 19:59:04,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120193 states. [2018-10-26 19:59:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120193 states to 120193 states and 136330 transitions. [2018-10-26 19:59:04,951 INFO L78 Accepts]: Start accepts. Automaton has 120193 states and 136330 transitions. Word has length 343 [2018-10-26 19:59:04,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:04,952 INFO L481 AbstractCegarLoop]: Abstraction has 120193 states and 136330 transitions. [2018-10-26 19:59:04,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:59:04,952 INFO L276 IsEmpty]: Start isEmpty. Operand 120193 states and 136330 transitions. [2018-10-26 19:59:04,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-26 19:59:04,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:04,999 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:59:04,999 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:04,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:05,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1887185285, now seen corresponding path program 1 times [2018-10-26 19:59:05,000 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:05,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:05,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:05,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:05,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:05,624 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:59:05,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:05,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:59:05,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:59:05,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:59:05,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:05,626 INFO L87 Difference]: Start difference. First operand 120193 states and 136330 transitions. Second operand 4 states. [2018-10-26 19:59:09,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:09,204 INFO L93 Difference]: Finished difference Result 253863 states and 287648 transitions. [2018-10-26 19:59:09,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:59:09,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 346 [2018-10-26 19:59:09,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:09,373 INFO L225 Difference]: With dead ends: 253863 [2018-10-26 19:59:09,374 INFO L226 Difference]: Without dead ends: 133670 [2018-10-26 19:59:09,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:09,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133670 states. [2018-10-26 19:59:10,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133670 to 125701. [2018-10-26 19:59:10,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125701 states. [2018-10-26 19:59:10,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125701 states to 125701 states and 142381 transitions. [2018-10-26 19:59:10,793 INFO L78 Accepts]: Start accepts. Automaton has 125701 states and 142381 transitions. Word has length 346 [2018-10-26 19:59:10,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:10,793 INFO L481 AbstractCegarLoop]: Abstraction has 125701 states and 142381 transitions. [2018-10-26 19:59:10,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:59:10,793 INFO L276 IsEmpty]: Start isEmpty. Operand 125701 states and 142381 transitions. [2018-10-26 19:59:10,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-26 19:59:10,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:10,827 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:59:10,827 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:10,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:10,827 INFO L82 PathProgramCache]: Analyzing trace with hash -308493581, now seen corresponding path program 1 times [2018-10-26 19:59:10,827 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:10,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:10,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:10,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:10,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:11,212 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 19:59:11,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:11,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:59:11,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:59:11,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:59:11,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:11,213 INFO L87 Difference]: Start difference. First operand 125701 states and 142381 transitions. Second operand 4 states. [2018-10-26 19:59:14,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:14,963 INFO L93 Difference]: Finished difference Result 383508 states and 430610 transitions. [2018-10-26 19:59:14,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:59:14,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 351 [2018-10-26 19:59:14,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:15,301 INFO L225 Difference]: With dead ends: 383508 [2018-10-26 19:59:15,302 INFO L226 Difference]: Without dead ends: 257809 [2018-10-26 19:59:15,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:15,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257809 states. [2018-10-26 19:59:18,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257809 to 199723. [2018-10-26 19:59:18,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199723 states. [2018-10-26 19:59:19,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199723 states to 199723 states and 222879 transitions. [2018-10-26 19:59:19,219 INFO L78 Accepts]: Start accepts. Automaton has 199723 states and 222879 transitions. Word has length 351 [2018-10-26 19:59:19,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:19,220 INFO L481 AbstractCegarLoop]: Abstraction has 199723 states and 222879 transitions. [2018-10-26 19:59:19,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:59:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 199723 states and 222879 transitions. [2018-10-26 19:59:19,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-10-26 19:59:19,273 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:19,273 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:59:19,274 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:19,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:19,274 INFO L82 PathProgramCache]: Analyzing trace with hash 2131786340, now seen corresponding path program 1 times [2018-10-26 19:59:19,274 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:19,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:19,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:19,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:19,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:19,979 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-10-26 19:59:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-26 19:59:20,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:20,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:59:20,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:59:20,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:59:20,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:59:20,145 INFO L87 Difference]: Start difference. First operand 199723 states and 222879 transitions. Second operand 5 states. [2018-10-26 19:59:29,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:29,038 INFO L93 Difference]: Finished difference Result 920219 states and 1025126 transitions. [2018-10-26 19:59:29,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:59:29,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 372 [2018-10-26 19:59:29,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:30,079 INFO L225 Difference]: With dead ends: 920219 [2018-10-26 19:59:30,079 INFO L226 Difference]: Without dead ends: 720498 [2018-10-26 19:59:30,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:59:30,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720498 states. [2018-10-26 19:59:44,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720498 to 521142. [2018-10-26 19:59:44,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521142 states. [2018-10-26 19:59:46,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521142 states to 521142 states and 579669 transitions. [2018-10-26 19:59:46,630 INFO L78 Accepts]: Start accepts. Automaton has 521142 states and 579669 transitions. Word has length 372 [2018-10-26 19:59:46,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:46,630 INFO L481 AbstractCegarLoop]: Abstraction has 521142 states and 579669 transitions. [2018-10-26 19:59:46,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:59:46,630 INFO L276 IsEmpty]: Start isEmpty. Operand 521142 states and 579669 transitions. [2018-10-26 19:59:46,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-10-26 19:59:46,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:46,675 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:59:46,675 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:46,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:46,676 INFO L82 PathProgramCache]: Analyzing trace with hash -656143452, now seen corresponding path program 1 times [2018-10-26 19:59:46,676 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:46,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:46,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:46,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:46,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-26 19:59:47,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:47,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:59:47,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:59:47,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:59:47,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:47,073 INFO L87 Difference]: Start difference. First operand 521142 states and 579669 transitions. Second operand 4 states. [2018-10-26 19:59:53,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:53,445 INFO L93 Difference]: Finished difference Result 1051794 states and 1170526 transitions. [2018-10-26 19:59:53,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:59:53,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 401 [2018-10-26 19:59:53,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:54,090 INFO L225 Difference]: With dead ends: 1051794 [2018-10-26 19:59:54,090 INFO L226 Difference]: Without dead ends: 530654 [2018-10-26 19:59:54,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:54,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530654 states. [2018-10-26 20:00:02,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530654 to 522788. [2018-10-26 20:00:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522788 states. [2018-10-26 20:00:02,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522788 states to 522788 states and 580184 transitions. [2018-10-26 20:00:02,794 INFO L78 Accepts]: Start accepts. Automaton has 522788 states and 580184 transitions. Word has length 401 [2018-10-26 20:00:02,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:02,794 INFO L481 AbstractCegarLoop]: Abstraction has 522788 states and 580184 transitions. [2018-10-26 20:00:02,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand 522788 states and 580184 transitions. [2018-10-26 20:00:02,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-10-26 20:00:02,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:02,852 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:00:02,852 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:02,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:02,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1619004822, now seen corresponding path program 1 times [2018-10-26 20:00:02,853 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:02,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:02,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:02,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:02,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:11,247 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-10-26 20:00:11,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:11,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:00:11,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:00:11,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:00:11,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:00:11,249 INFO L87 Difference]: Start difference. First operand 522788 states and 580184 transitions. Second operand 3 states. [2018-10-26 20:00:16,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:16,336 INFO L93 Difference]: Finished difference Result 1457648 states and 1614754 transitions. [2018-10-26 20:00:16,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:00:16,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 451 [2018-10-26 20:00:16,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:19,290 INFO L225 Difference]: With dead ends: 1457648 [2018-10-26 20:00:19,290 INFO L226 Difference]: Without dead ends: 934862 [2018-10-26 20:00:19,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:00:20,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934862 states. [2018-10-26 20:00:31,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934862 to 892015. [2018-10-26 20:00:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892015 states. [2018-10-26 20:00:33,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892015 states to 892015 states and 983556 transitions. [2018-10-26 20:00:33,143 INFO L78 Accepts]: Start accepts. Automaton has 892015 states and 983556 transitions. Word has length 451 [2018-10-26 20:00:33,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:33,144 INFO L481 AbstractCegarLoop]: Abstraction has 892015 states and 983556 transitions. [2018-10-26 20:00:33,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:00:33,144 INFO L276 IsEmpty]: Start isEmpty. Operand 892015 states and 983556 transitions. [2018-10-26 20:00:33,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2018-10-26 20:00:33,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:33,252 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:00:33,253 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:33,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:33,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1514659374, now seen corresponding path program 1 times [2018-10-26 20:00:33,253 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:33,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:33,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:33,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:33,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:35,839 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 20:00:36,061 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 20:00:36,328 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-26 20:00:36,683 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-10-26 20:00:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 337 proven. 29 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-26 20:00:37,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:00:37,132 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:00:37,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:37,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:00:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 256 proven. 115 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-26 20:00:45,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 20:00:45,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 11 [2018-10-26 20:00:45,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 20:00:45,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 20:00:45,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-10-26 20:00:45,388 INFO L87 Difference]: Start difference. First operand 892015 states and 983556 transitions. Second operand 12 states.