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_label35_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 13:17:12,269 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 13:17:12,271 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 13:17:12,292 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 13:17:12,292 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 13:17:12,293 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 13:17:12,296 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 13:17:12,302 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 13:17:12,304 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 13:17:12,305 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 13:17:12,307 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 13:17:12,308 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 13:17:12,308 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 13:17:12,310 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 13:17:12,311 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 13:17:12,312 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 13:17:12,312 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 13:17:12,317 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 13:17:12,319 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 13:17:12,322 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 13:17:12,325 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 13:17:12,328 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 13:17:12,333 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 13:17:12,333 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 13:17:12,333 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 13:17:12,334 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 13:17:12,336 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 13:17:12,337 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 13:17:12,339 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 13:17:12,340 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 13:17:12,340 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 13:17:12,343 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 13:17:12,343 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 13:17:12,343 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 13:17:12,344 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 13:17:12,345 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 13:17:12,345 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 13:17:12,360 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 13:17:12,360 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 13:17:12,361 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 13:17:12,361 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 13:17:12,362 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 13:17:12,362 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 13:17:12,362 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 13:17:12,363 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 13:17:12,363 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 13:17:12,363 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 13:17:12,363 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 13:17:12,363 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 13:17:12,364 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 13:17:12,364 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 13:17:12,364 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 13:17:12,364 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 13:17:12,364 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 13:17:12,364 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 13:17:12,365 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 13:17:12,365 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 13:17:12,365 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 13:17:12,365 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 13:17:12,365 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 13:17:12,366 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 13:17:12,366 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 13:17:12,366 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 13:17:12,366 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 13:17:12,366 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 13:17:12,435 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 13:17:12,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 13:17:12,453 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 13:17:12,454 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 13:17:12,455 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 13:17:12,455 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label35_false-unreach-call.c [2018-10-24 13:17:12,527 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/171777f2a/22c19831732b4a57a1878631a28795cd/FLAG366ef6e5c [2018-10-24 13:17:13,186 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 13:17:13,187 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label35_false-unreach-call.c [2018-10-24 13:17:13,205 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/171777f2a/22c19831732b4a57a1878631a28795cd/FLAG366ef6e5c [2018-10-24 13:17:13,228 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/171777f2a/22c19831732b4a57a1878631a28795cd [2018-10-24 13:17:13,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 13:17:13,243 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 13:17:13,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 13:17:13,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 13:17:13,251 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 13:17:13,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:17:13" (1/1) ... [2018-10-24 13:17:13,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c237445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:13, skipping insertion in model container [2018-10-24 13:17:13,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:17:13" (1/1) ... [2018-10-24 13:17:13,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 13:17:13,374 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 13:17:14,118 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 13:17:14,124 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 13:17:14,643 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 13:17:14,668 INFO L193 MainTranslator]: Completed translation [2018-10-24 13:17:14,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:14 WrapperNode [2018-10-24 13:17:14,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 13:17:14,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 13:17:14,673 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 13:17:14,673 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 13:17:14,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:14" (1/1) ... [2018-10-24 13:17:14,736 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:14" (1/1) ... [2018-10-24 13:17:14,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 13:17:14,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 13:17:14,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 13:17:14,986 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 13:17:14,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:14" (1/1) ... [2018-10-24 13:17:14,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:14" (1/1) ... [2018-10-24 13:17:15,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:14" (1/1) ... [2018-10-24 13:17:15,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:14" (1/1) ... [2018-10-24 13:17:15,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:14" (1/1) ... [2018-10-24 13:17:15,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:14" (1/1) ... [2018-10-24 13:17:15,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:14" (1/1) ... [2018-10-24 13:17:15,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 13:17:15,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 13:17:15,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 13:17:15,120 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 13:17:15,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 13:17:15,186 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 13:17:15,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 13:17:15,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 13:17:20,598 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 13:17:20,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:17:20 BoogieIcfgContainer [2018-10-24 13:17:20,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 13:17:20,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 13:17:20,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 13:17:20,604 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 13:17:20,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:17:13" (1/3) ... [2018-10-24 13:17:20,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5456f37f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:17:20, skipping insertion in model container [2018-10-24 13:17:20,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:14" (2/3) ... [2018-10-24 13:17:20,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5456f37f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:17:20, skipping insertion in model container [2018-10-24 13:17:20,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:17:20" (3/3) ... [2018-10-24 13:17:20,608 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label35_false-unreach-call.c [2018-10-24 13:17:20,618 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 13:17:20,629 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 13:17:20,646 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 13:17:20,684 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 13:17:20,685 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 13:17:20,685 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 13:17:20,685 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 13:17:20,685 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 13:17:20,685 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 13:17:20,686 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 13:17:20,686 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 13:17:20,686 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 13:17:20,715 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 13:17:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-24 13:17:20,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:20,732 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] [2018-10-24 13:17:20,735 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:20,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:20,740 INFO L82 PathProgramCache]: Analyzing trace with hash 791582076, now seen corresponding path program 1 times [2018-10-24 13:17:20,742 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:20,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:20,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:20,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:20,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:21,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:21,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:21,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:21,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:21,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:21,670 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 13:17:25,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:25,082 INFO L93 Difference]: Finished difference Result 1072 states and 1917 transitions. [2018-10-24 13:17:25,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:17:25,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2018-10-24 13:17:25,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:25,110 INFO L225 Difference]: With dead ends: 1072 [2018-10-24 13:17:25,110 INFO L226 Difference]: Without dead ends: 762 [2018-10-24 13:17:25,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-10-24 13:17:25,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 518. [2018-10-24 13:17:25,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-10-24 13:17:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 855 transitions. [2018-10-24 13:17:25,204 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 855 transitions. Word has length 146 [2018-10-24 13:17:25,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:25,205 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 855 transitions. [2018-10-24 13:17:25,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:17:25,206 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 855 transitions. [2018-10-24 13:17:25,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-24 13:17:25,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:25,211 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:25,212 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:25,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:25,212 INFO L82 PathProgramCache]: Analyzing trace with hash 729170733, now seen corresponding path program 1 times [2018-10-24 13:17:25,212 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:25,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:25,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:25,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:25,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:25,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:25,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:25,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:25,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:25,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:25,511 INFO L87 Difference]: Start difference. First operand 518 states and 855 transitions. Second operand 4 states. [2018-10-24 13:17:28,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:28,810 INFO L93 Difference]: Finished difference Result 1918 states and 3253 transitions. [2018-10-24 13:17:28,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:17:28,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-10-24 13:17:28,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:28,820 INFO L225 Difference]: With dead ends: 1918 [2018-10-24 13:17:28,820 INFO L226 Difference]: Without dead ends: 1402 [2018-10-24 13:17:28,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:28,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2018-10-24 13:17:28,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 933. [2018-10-24 13:17:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-24 13:17:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1472 transitions. [2018-10-24 13:17:28,885 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1472 transitions. Word has length 152 [2018-10-24 13:17:28,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:28,887 INFO L481 AbstractCegarLoop]: Abstraction has 933 states and 1472 transitions. [2018-10-24 13:17:28,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:17:28,887 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1472 transitions. [2018-10-24 13:17:28,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-24 13:17:28,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:28,898 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] [2018-10-24 13:17:28,898 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:28,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:28,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1702396603, now seen corresponding path program 1 times [2018-10-24 13:17:28,899 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:28,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:28,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:28,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:28,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:29,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:29,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:17:29,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:29,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:29,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:29,040 INFO L87 Difference]: Start difference. First operand 933 states and 1472 transitions. Second operand 3 states. [2018-10-24 13:17:34,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:34,500 INFO L93 Difference]: Finished difference Result 2699 states and 4315 transitions. [2018-10-24 13:17:34,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:34,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2018-10-24 13:17:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:34,512 INFO L225 Difference]: With dead ends: 2699 [2018-10-24 13:17:34,512 INFO L226 Difference]: Without dead ends: 1768 [2018-10-24 13:17:34,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-10-24 13:17:34,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1751. [2018-10-24 13:17:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2018-10-24 13:17:34,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2699 transitions. [2018-10-24 13:17:34,572 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2699 transitions. Word has length 155 [2018-10-24 13:17:34,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:34,572 INFO L481 AbstractCegarLoop]: Abstraction has 1751 states and 2699 transitions. [2018-10-24 13:17:34,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:34,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2699 transitions. [2018-10-24 13:17:34,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-24 13:17:34,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:34,577 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 13:17:34,578 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:34,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:34,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1113217004, now seen corresponding path program 1 times [2018-10-24 13:17:34,578 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:34,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:34,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:34,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:34,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:34,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:34,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:34,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:34,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:34,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:34,847 INFO L87 Difference]: Start difference. First operand 1751 states and 2699 transitions. Second operand 4 states. [2018-10-24 13:17:39,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:39,225 INFO L93 Difference]: Finished difference Result 6813 states and 10581 transitions. [2018-10-24 13:17:39,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:17:39,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-10-24 13:17:39,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:39,251 INFO L225 Difference]: With dead ends: 6813 [2018-10-24 13:17:39,251 INFO L226 Difference]: Without dead ends: 5064 [2018-10-24 13:17:39,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5064 states. [2018-10-24 13:17:39,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5064 to 3388. [2018-10-24 13:17:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2018-10-24 13:17:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4947 transitions. [2018-10-24 13:17:39,327 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4947 transitions. Word has length 162 [2018-10-24 13:17:39,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:39,328 INFO L481 AbstractCegarLoop]: Abstraction has 3388 states and 4947 transitions. [2018-10-24 13:17:39,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:17:39,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4947 transitions. [2018-10-24 13:17:39,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-24 13:17:39,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:39,333 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] [2018-10-24 13:17:39,334 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:39,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:39,334 INFO L82 PathProgramCache]: Analyzing trace with hash 100294031, now seen corresponding path program 1 times [2018-10-24 13:17:39,334 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:39,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:39,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:39,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:39,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 13:17:39,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:39,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:39,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:39,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:39,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:39,562 INFO L87 Difference]: Start difference. First operand 3388 states and 4947 transitions. Second operand 3 states. [2018-10-24 13:17:41,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:41,029 INFO L93 Difference]: Finished difference Result 6782 states and 9907 transitions. [2018-10-24 13:17:41,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:41,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2018-10-24 13:17:41,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:41,045 INFO L225 Difference]: With dead ends: 6782 [2018-10-24 13:17:41,045 INFO L226 Difference]: Without dead ends: 3396 [2018-10-24 13:17:41,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:41,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3396 states. [2018-10-24 13:17:41,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3396 to 3388. [2018-10-24 13:17:41,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2018-10-24 13:17:41,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4647 transitions. [2018-10-24 13:17:41,115 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4647 transitions. Word has length 163 [2018-10-24 13:17:41,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:41,115 INFO L481 AbstractCegarLoop]: Abstraction has 3388 states and 4647 transitions. [2018-10-24 13:17:41,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:41,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4647 transitions. [2018-10-24 13:17:41,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-24 13:17:41,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:41,123 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:41,123 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:41,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:41,124 INFO L82 PathProgramCache]: Analyzing trace with hash -729018483, now seen corresponding path program 1 times [2018-10-24 13:17:41,124 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:41,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:41,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:41,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:41,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 13:17:41,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:41,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:17:41,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:41,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:41,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:41,284 INFO L87 Difference]: Start difference. First operand 3388 states and 4647 transitions. Second operand 3 states. [2018-10-24 13:17:42,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:42,135 INFO L93 Difference]: Finished difference Result 6742 states and 9249 transitions. [2018-10-24 13:17:42,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:42,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2018-10-24 13:17:42,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:42,151 INFO L225 Difference]: With dead ends: 6742 [2018-10-24 13:17:42,151 INFO L226 Difference]: Without dead ends: 3356 [2018-10-24 13:17:42,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3356 states. [2018-10-24 13:17:42,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3356 to 3356. [2018-10-24 13:17:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3356 states. [2018-10-24 13:17:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3356 states to 3356 states and 4534 transitions. [2018-10-24 13:17:42,210 INFO L78 Accepts]: Start accepts. Automaton has 3356 states and 4534 transitions. Word has length 184 [2018-10-24 13:17:42,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:42,210 INFO L481 AbstractCegarLoop]: Abstraction has 3356 states and 4534 transitions. [2018-10-24 13:17:42,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3356 states and 4534 transitions. [2018-10-24 13:17:42,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-24 13:17:42,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:42,217 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 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] [2018-10-24 13:17:42,217 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:42,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:42,218 INFO L82 PathProgramCache]: Analyzing trace with hash 646667323, now seen corresponding path program 1 times [2018-10-24 13:17:42,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:42,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:42,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:42,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:42,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-24 13:17:42,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:42,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:42,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:42,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:42,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:42,349 INFO L87 Difference]: Start difference. First operand 3356 states and 4534 transitions. Second operand 3 states. [2018-10-24 13:17:43,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:43,679 INFO L93 Difference]: Finished difference Result 9977 states and 13505 transitions. [2018-10-24 13:17:43,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:43,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2018-10-24 13:17:43,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:43,706 INFO L225 Difference]: With dead ends: 9977 [2018-10-24 13:17:43,706 INFO L226 Difference]: Without dead ends: 6623 [2018-10-24 13:17:43,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:43,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6623 states. [2018-10-24 13:17:43,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6623 to 6620. [2018-10-24 13:17:43,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6620 states. [2018-10-24 13:17:43,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6620 states to 6620 states and 8174 transitions. [2018-10-24 13:17:43,832 INFO L78 Accepts]: Start accepts. Automaton has 6620 states and 8174 transitions. Word has length 194 [2018-10-24 13:17:43,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:43,833 INFO L481 AbstractCegarLoop]: Abstraction has 6620 states and 8174 transitions. [2018-10-24 13:17:43,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:43,833 INFO L276 IsEmpty]: Start isEmpty. Operand 6620 states and 8174 transitions. [2018-10-24 13:17:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-24 13:17:43,846 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:43,846 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:43,847 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:43,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:43,847 INFO L82 PathProgramCache]: Analyzing trace with hash -103110850, now seen corresponding path program 1 times [2018-10-24 13:17:43,847 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:43,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:43,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:43,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:43,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:44,038 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 13:17:44,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:44,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:44,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:44,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:44,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:44,040 INFO L87 Difference]: Start difference. First operand 6620 states and 8174 transitions. Second operand 3 states. [2018-10-24 13:17:45,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:45,412 INFO L93 Difference]: Finished difference Result 16094 states and 20196 transitions. [2018-10-24 13:17:45,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:45,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-10-24 13:17:45,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:45,447 INFO L225 Difference]: With dead ends: 16094 [2018-10-24 13:17:45,447 INFO L226 Difference]: Without dead ends: 9476 [2018-10-24 13:17:45,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:45,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9476 states. [2018-10-24 13:17:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9476 to 9476. [2018-10-24 13:17:45,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9476 states. [2018-10-24 13:17:45,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9476 states to 9476 states and 11228 transitions. [2018-10-24 13:17:45,600 INFO L78 Accepts]: Start accepts. Automaton has 9476 states and 11228 transitions. Word has length 219 [2018-10-24 13:17:45,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:45,600 INFO L481 AbstractCegarLoop]: Abstraction has 9476 states and 11228 transitions. [2018-10-24 13:17:45,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 9476 states and 11228 transitions. [2018-10-24 13:17:45,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-24 13:17:45,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:45,613 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 13:17:45,613 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:45,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:45,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1490986690, now seen corresponding path program 1 times [2018-10-24 13:17:45,614 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:45,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:45,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:45,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:45,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:46,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:46,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:46,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:46,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:46,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:46,007 INFO L87 Difference]: Start difference. First operand 9476 states and 11228 transitions. Second operand 4 states. [2018-10-24 13:17:48,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:48,415 INFO L93 Difference]: Finished difference Result 33884 states and 39720 transitions. [2018-10-24 13:17:48,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:17:48,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 222 [2018-10-24 13:17:48,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:48,458 INFO L225 Difference]: With dead ends: 33884 [2018-10-24 13:17:48,458 INFO L226 Difference]: Without dead ends: 24410 [2018-10-24 13:17:48,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:48,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24410 states. [2018-10-24 13:17:48,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24410 to 17635. [2018-10-24 13:17:48,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17635 states. [2018-10-24 13:17:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17635 states to 17635 states and 20482 transitions. [2018-10-24 13:17:48,718 INFO L78 Accepts]: Start accepts. Automaton has 17635 states and 20482 transitions. Word has length 222 [2018-10-24 13:17:48,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:48,719 INFO L481 AbstractCegarLoop]: Abstraction has 17635 states and 20482 transitions. [2018-10-24 13:17:48,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:17:48,719 INFO L276 IsEmpty]: Start isEmpty. Operand 17635 states and 20482 transitions. [2018-10-24 13:17:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-24 13:17:48,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:48,737 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] [2018-10-24 13:17:48,737 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:48,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:48,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2066119172, now seen corresponding path program 1 times [2018-10-24 13:17:48,738 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:48,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:48,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:48,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:48,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:48,912 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-24 13:17:48,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:48,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:48,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:48,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:48,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:48,914 INFO L87 Difference]: Start difference. First operand 17635 states and 20482 transitions. Second operand 3 states. [2018-10-24 13:17:50,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:50,463 INFO L93 Difference]: Finished difference Result 35269 states and 40964 transitions. [2018-10-24 13:17:50,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:50,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2018-10-24 13:17:50,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:50,501 INFO L225 Difference]: With dead ends: 35269 [2018-10-24 13:17:50,501 INFO L226 Difference]: Without dead ends: 17636 [2018-10-24 13:17:50,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:50,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17636 states. [2018-10-24 13:17:50,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17636 to 17635. [2018-10-24 13:17:50,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17635 states. [2018-10-24 13:17:50,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17635 states to 17635 states and 19868 transitions. [2018-10-24 13:17:50,722 INFO L78 Accepts]: Start accepts. Automaton has 17635 states and 19868 transitions. Word has length 237 [2018-10-24 13:17:50,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:50,722 INFO L481 AbstractCegarLoop]: Abstraction has 17635 states and 19868 transitions. [2018-10-24 13:17:50,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:50,723 INFO L276 IsEmpty]: Start isEmpty. Operand 17635 states and 19868 transitions. [2018-10-24 13:17:50,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-24 13:17:50,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:50,740 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:50,740 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:50,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:50,741 INFO L82 PathProgramCache]: Analyzing trace with hash -662729768, now seen corresponding path program 1 times [2018-10-24 13:17:50,741 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:50,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:50,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:50,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:50,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:50,940 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-24 13:17:50,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:50,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:50,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:50,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:50,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:50,941 INFO L87 Difference]: Start difference. First operand 17635 states and 19868 transitions. Second operand 4 states. [2018-10-24 13:17:52,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:52,493 INFO L93 Difference]: Finished difference Result 34858 states and 39287 transitions. [2018-10-24 13:17:52,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:17:52,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 248 [2018-10-24 13:17:52,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:52,521 INFO L225 Difference]: With dead ends: 34858 [2018-10-24 13:17:52,521 INFO L226 Difference]: Without dead ends: 17225 [2018-10-24 13:17:52,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:52,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17225 states. [2018-10-24 13:17:52,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17225 to 17225. [2018-10-24 13:17:52,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17225 states. [2018-10-24 13:17:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17225 states to 17225 states and 18762 transitions. [2018-10-24 13:17:52,748 INFO L78 Accepts]: Start accepts. Automaton has 17225 states and 18762 transitions. Word has length 248 [2018-10-24 13:17:52,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:52,748 INFO L481 AbstractCegarLoop]: Abstraction has 17225 states and 18762 transitions. [2018-10-24 13:17:52,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:17:52,749 INFO L276 IsEmpty]: Start isEmpty. Operand 17225 states and 18762 transitions. [2018-10-24 13:17:52,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-24 13:17:52,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:52,765 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:52,765 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:52,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:52,765 INFO L82 PathProgramCache]: Analyzing trace with hash 377823859, now seen corresponding path program 1 times [2018-10-24 13:17:52,765 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:52,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:52,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:52,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:52,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-24 13:17:53,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:53,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:53,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:53,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:53,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:53,125 INFO L87 Difference]: Start difference. First operand 17225 states and 18762 transitions. Second operand 4 states. [2018-10-24 13:17:55,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:55,985 INFO L93 Difference]: Finished difference Result 66638 states and 72402 transitions. [2018-10-24 13:17:55,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:17:55,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 250 [2018-10-24 13:17:55,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:56,044 INFO L225 Difference]: With dead ends: 66638 [2018-10-24 13:17:56,044 INFO L226 Difference]: Without dead ends: 49415 [2018-10-24 13:17:56,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:56,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49415 states. [2018-10-24 13:17:56,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49415 to 49411. [2018-10-24 13:17:56,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49411 states. [2018-10-24 13:17:56,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49411 states to 49411 states and 53576 transitions. [2018-10-24 13:17:56,877 INFO L78 Accepts]: Start accepts. Automaton has 49411 states and 53576 transitions. Word has length 250 [2018-10-24 13:17:56,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:56,878 INFO L481 AbstractCegarLoop]: Abstraction has 49411 states and 53576 transitions. [2018-10-24 13:17:56,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:17:56,878 INFO L276 IsEmpty]: Start isEmpty. Operand 49411 states and 53576 transitions. [2018-10-24 13:17:56,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-24 13:17:56,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:56,893 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:56,894 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:56,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:56,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1438685273, now seen corresponding path program 1 times [2018-10-24 13:17:56,894 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:56,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:56,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:56,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:56,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:57,093 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-24 13:17:57,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:57,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:17:57,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:57,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:57,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:57,094 INFO L87 Difference]: Start difference. First operand 49411 states and 53576 transitions. Second operand 3 states. [2018-10-24 13:17:57,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:57,980 INFO L93 Difference]: Finished difference Result 98817 states and 107147 transitions. [2018-10-24 13:17:57,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:57,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2018-10-24 13:17:57,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:58,045 INFO L225 Difference]: With dead ends: 98817 [2018-10-24 13:17:58,045 INFO L226 Difference]: Without dead ends: 49408 [2018-10-24 13:17:58,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:58,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49408 states. [2018-10-24 13:17:58,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49408 to 49408. [2018-10-24 13:17:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49408 states. [2018-10-24 13:17:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49408 states to 49408 states and 53570 transitions. [2018-10-24 13:17:58,744 INFO L78 Accepts]: Start accepts. Automaton has 49408 states and 53570 transitions. Word has length 274 [2018-10-24 13:17:58,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:58,744 INFO L481 AbstractCegarLoop]: Abstraction has 49408 states and 53570 transitions. [2018-10-24 13:17:58,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:58,745 INFO L276 IsEmpty]: Start isEmpty. Operand 49408 states and 53570 transitions. [2018-10-24 13:17:58,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-24 13:17:58,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:58,763 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:58,763 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:58,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:58,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1233830946, now seen corresponding path program 1 times [2018-10-24 13:17:58,764 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:58,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:58,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:58,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:58,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:59,480 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-24 13:17:59,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:59,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:17:59,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:59,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:59,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:59,482 INFO L87 Difference]: Start difference. First operand 49408 states and 53570 transitions. Second operand 3 states. [2018-10-24 13:18:01,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:01,456 INFO L93 Difference]: Finished difference Result 123624 states and 133953 transitions. [2018-10-24 13:18:01,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:18:01,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2018-10-24 13:18:01,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:01,535 INFO L225 Difference]: With dead ends: 123624 [2018-10-24 13:18:01,535 INFO L226 Difference]: Without dead ends: 74218 [2018-10-24 13:18:01,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:01,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74218 states. [2018-10-24 13:18:02,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74218 to 74210. [2018-10-24 13:18:02,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74210 states. [2018-10-24 13:18:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74210 states to 74210 states and 80304 transitions. [2018-10-24 13:18:02,400 INFO L78 Accepts]: Start accepts. Automaton has 74210 states and 80304 transitions. Word has length 284 [2018-10-24 13:18:02,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:02,400 INFO L481 AbstractCegarLoop]: Abstraction has 74210 states and 80304 transitions. [2018-10-24 13:18:02,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:18:02,400 INFO L276 IsEmpty]: Start isEmpty. Operand 74210 states and 80304 transitions. [2018-10-24 13:18:02,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-24 13:18:02,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:02,416 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:02,416 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:02,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:02,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1239603055, now seen corresponding path program 1 times [2018-10-24 13:18:02,417 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:02,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:02,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:02,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:02,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-24 13:18:02,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:02,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:18:02,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:18:02,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:18:02,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:02,745 INFO L87 Difference]: Start difference. First operand 74210 states and 80304 transitions. Second operand 4 states. [2018-10-24 13:18:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:05,915 INFO L93 Difference]: Finished difference Result 151914 states and 164444 transitions. [2018-10-24 13:18:05,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:18:05,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 290 [2018-10-24 13:18:05,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:06,008 INFO L225 Difference]: With dead ends: 151914 [2018-10-24 13:18:06,008 INFO L226 Difference]: Without dead ends: 77706 [2018-10-24 13:18:06,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:06,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77706 states. [2018-10-24 13:18:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77706 to 77684. [2018-10-24 13:18:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77684 states. [2018-10-24 13:18:06,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77684 states to 77684 states and 83868 transitions. [2018-10-24 13:18:06,974 INFO L78 Accepts]: Start accepts. Automaton has 77684 states and 83868 transitions. Word has length 290 [2018-10-24 13:18:06,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:06,974 INFO L481 AbstractCegarLoop]: Abstraction has 77684 states and 83868 transitions. [2018-10-24 13:18:06,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:18:06,975 INFO L276 IsEmpty]: Start isEmpty. Operand 77684 states and 83868 transitions. [2018-10-24 13:18:06,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-24 13:18:06,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:06,986 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:06,986 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:06,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:06,986 INFO L82 PathProgramCache]: Analyzing trace with hash -425884722, now seen corresponding path program 1 times [2018-10-24 13:18:06,986 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:06,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:06,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:06,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:06,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-24 13:18:07,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:18:07,201 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 13:18:07,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:07,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:18:07,580 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-10-24 13:18:07,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 13:18:07,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-24 13:18:07,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 13:18:07,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 13:18:07,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 13:18:07,615 INFO L87 Difference]: Start difference. First operand 77684 states and 83868 transitions. Second operand 6 states. [2018-10-24 13:18:15,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:15,434 INFO L93 Difference]: Finished difference Result 243871 states and 264093 transitions. [2018-10-24 13:18:15,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 13:18:15,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 292 [2018-10-24 13:18:15,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:15,618 INFO L225 Difference]: With dead ends: 243871 [2018-10-24 13:18:15,618 INFO L226 Difference]: Without dead ends: 166189 [2018-10-24 13:18:15,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-24 13:18:15,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166189 states. [2018-10-24 13:18:18,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166189 to 148823. [2018-10-24 13:18:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148823 states. [2018-10-24 13:18:19,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148823 states to 148823 states and 159176 transitions. [2018-10-24 13:18:19,437 INFO L78 Accepts]: Start accepts. Automaton has 148823 states and 159176 transitions. Word has length 292 [2018-10-24 13:18:19,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:19,438 INFO L481 AbstractCegarLoop]: Abstraction has 148823 states and 159176 transitions. [2018-10-24 13:18:19,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 13:18:19,438 INFO L276 IsEmpty]: Start isEmpty. Operand 148823 states and 159176 transitions. [2018-10-24 13:18:19,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-10-24 13:18:19,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:19,455 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:19,455 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:19,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:19,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1286188421, now seen corresponding path program 1 times [2018-10-24 13:18:19,456 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:19,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:19,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:19,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:19,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-24 13:18:19,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:19,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 13:18:19,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:18:19,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:18:19,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:19,904 INFO L87 Difference]: Start difference. First operand 148823 states and 159176 transitions. Second operand 4 states. [2018-10-24 13:18:23,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:23,762 INFO L93 Difference]: Finished difference Result 314450 states and 336870 transitions. [2018-10-24 13:18:23,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:18:23,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 323 [2018-10-24 13:18:23,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:23,933 INFO L225 Difference]: With dead ends: 314450 [2018-10-24 13:18:23,933 INFO L226 Difference]: Without dead ends: 165629 [2018-10-24 13:18:24,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:24,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165629 states. [2018-10-24 13:18:26,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165629 to 153518. [2018-10-24 13:18:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153518 states. [2018-10-24 13:18:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153518 states to 153518 states and 164107 transitions. [2018-10-24 13:18:26,650 INFO L78 Accepts]: Start accepts. Automaton has 153518 states and 164107 transitions. Word has length 323 [2018-10-24 13:18:26,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:26,650 INFO L481 AbstractCegarLoop]: Abstraction has 153518 states and 164107 transitions. [2018-10-24 13:18:26,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:18:26,650 INFO L276 IsEmpty]: Start isEmpty. Operand 153518 states and 164107 transitions. [2018-10-24 13:18:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-10-24 13:18:26,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:26,673 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 13:18:26,674 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:26,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:26,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1270245533, now seen corresponding path program 1 times [2018-10-24 13:18:26,674 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:26,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:26,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:26,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:26,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:27,192 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 13:18:27,408 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-24 13:18:27,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:27,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 13:18:27,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 13:18:27,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 13:18:27,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 13:18:27,411 INFO L87 Difference]: Start difference. First operand 153518 states and 164107 transitions. Second operand 5 states. [2018-10-24 13:18:30,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:30,922 INFO L93 Difference]: Finished difference Result 404279 states and 430839 transitions. [2018-10-24 13:18:30,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 13:18:30,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 349 [2018-10-24 13:18:30,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:31,187 INFO L225 Difference]: With dead ends: 404279 [2018-10-24 13:18:31,187 INFO L226 Difference]: Without dead ends: 250763 [2018-10-24 13:18:31,277 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-24 13:18:31,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250763 states. [2018-10-24 13:18:34,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250763 to 242748. [2018-10-24 13:18:34,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242748 states. [2018-10-24 13:18:34,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242748 states to 242748 states and 258313 transitions. [2018-10-24 13:18:34,931 INFO L78 Accepts]: Start accepts. Automaton has 242748 states and 258313 transitions. Word has length 349 [2018-10-24 13:18:34,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:34,932 INFO L481 AbstractCegarLoop]: Abstraction has 242748 states and 258313 transitions. [2018-10-24 13:18:34,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 13:18:34,932 INFO L276 IsEmpty]: Start isEmpty. Operand 242748 states and 258313 transitions. [2018-10-24 13:18:34,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-10-24 13:18:34,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:34,963 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:34,964 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:34,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:34,964 INFO L82 PathProgramCache]: Analyzing trace with hash 158812755, now seen corresponding path program 1 times [2018-10-24 13:18:34,964 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:34,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:34,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:34,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:34,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:35,368 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2018-10-24 13:18:35,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:35,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 13:18:35,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 13:18:35,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 13:18:35,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 13:18:35,370 INFO L87 Difference]: Start difference. First operand 242748 states and 258313 transitions. Second operand 5 states. [2018-10-24 13:18:40,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:40,200 INFO L93 Difference]: Finished difference Result 589793 states and 628454 transitions. [2018-10-24 13:18:40,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 13:18:40,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 426 [2018-10-24 13:18:40,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:40,613 INFO L225 Difference]: With dead ends: 589793 [2018-10-24 13:18:40,613 INFO L226 Difference]: Without dead ends: 347047 [2018-10-24 13:18:40,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 13:18:41,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347047 states. [2018-10-24 13:18:50,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347047 to 338610. [2018-10-24 13:18:50,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338610 states. [2018-10-24 13:18:51,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338610 states to 338610 states and 360687 transitions. [2018-10-24 13:18:51,046 INFO L78 Accepts]: Start accepts. Automaton has 338610 states and 360687 transitions. Word has length 426 [2018-10-24 13:18:51,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:51,046 INFO L481 AbstractCegarLoop]: Abstraction has 338610 states and 360687 transitions. [2018-10-24 13:18:51,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 13:18:51,046 INFO L276 IsEmpty]: Start isEmpty. Operand 338610 states and 360687 transitions. [2018-10-24 13:18:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-10-24 13:18:51,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:51,073 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:51,073 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:51,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:51,074 INFO L82 PathProgramCache]: Analyzing trace with hash 2121898117, now seen corresponding path program 1 times [2018-10-24 13:18:51,074 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:51,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:51,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:51,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:51,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:51,505 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-10-24 13:18:51,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:51,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:18:51,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:18:51,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:18:51,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:51,506 INFO L87 Difference]: Start difference. First operand 338610 states and 360687 transitions. Second operand 4 states. [2018-10-24 13:18:55,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:55,998 INFO L93 Difference]: Finished difference Result 695005 states and 740259 transitions. [2018-10-24 13:18:55,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:18:55,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 429 [2018-10-24 13:18:55,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:56,398 INFO L225 Difference]: With dead ends: 695005 [2018-10-24 13:18:56,399 INFO L226 Difference]: Without dead ends: 356393 [2018-10-24 13:18:56,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:56,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356393 states. [2018-10-24 13:19:00,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356393 to 340446. [2018-10-24 13:19:00,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340446 states. [2018-10-24 13:19:02,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340446 states to 340446 states and 362529 transitions. [2018-10-24 13:19:02,254 INFO L78 Accepts]: Start accepts. Automaton has 340446 states and 362529 transitions. Word has length 429 [2018-10-24 13:19:02,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:19:02,255 INFO L481 AbstractCegarLoop]: Abstraction has 340446 states and 362529 transitions. [2018-10-24 13:19:02,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:19:02,255 INFO L276 IsEmpty]: Start isEmpty. Operand 340446 states and 362529 transitions. [2018-10-24 13:19:02,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-10-24 13:19:02,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:19:02,288 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:19:02,288 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:19:02,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:19:02,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1819684547, now seen corresponding path program 1 times [2018-10-24 13:19:02,289 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:19:02,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:19:02,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:02,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:19:02,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:19:02,914 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-24 13:19:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 312 proven. 59 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-10-24 13:19:03,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:19:03,708 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 13:19:03,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:19:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:19:03,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:19:04,161 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-10-24 13:19:04,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 13:19:04,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2018-10-24 13:19:04,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 13:19:04,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 13:19:04,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-24 13:19:04,203 INFO L87 Difference]: Start difference. First operand 340446 states and 362529 transitions. Second operand 10 states. [2018-10-24 13:19:04,541 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-24 13:19:12,668 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2018-10-24 13:19:16,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:19:16,770 INFO L93 Difference]: Finished difference Result 788358 states and 840761 transitions. [2018-10-24 13:19:16,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-24 13:19:16,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 434 [2018-10-24 13:19:16,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:19:17,247 INFO L225 Difference]: With dead ends: 788358 [2018-10-24 13:19:17,247 INFO L226 Difference]: Without dead ends: 438083 [2018-10-24 13:19:17,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 432 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2018-10-24 13:19:17,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438083 states. [2018-10-24 13:19:27,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438083 to 370496. [2018-10-24 13:19:27,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370496 states. [2018-10-24 13:19:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370496 states to 370496 states and 390081 transitions. [2018-10-24 13:19:27,942 INFO L78 Accepts]: Start accepts. Automaton has 370496 states and 390081 transitions. Word has length 434 [2018-10-24 13:19:27,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:19:27,943 INFO L481 AbstractCegarLoop]: Abstraction has 370496 states and 390081 transitions. [2018-10-24 13:19:27,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 13:19:27,943 INFO L276 IsEmpty]: Start isEmpty. Operand 370496 states and 390081 transitions. [2018-10-24 13:19:27,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-10-24 13:19:27,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:19:27,981 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:19:27,981 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:19:27,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:19:27,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1122661179, now seen corresponding path program 1 times [2018-10-24 13:19:27,982 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:19:27,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:19:27,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:27,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:19:27,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:19:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-24 13:19:28,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:19:28,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:19:28,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:19:28,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:19:28,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:19:28,535 INFO L87 Difference]: Start difference. First operand 370496 states and 390081 transitions. Second operand 4 states. [2018-10-24 13:19:35,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:19:35,102 INFO L93 Difference]: Finished difference Result 977534 states and 1028239 transitions. [2018-10-24 13:19:35,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:19:35,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 447 [2018-10-24 13:19:35,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:19:35,731 INFO L225 Difference]: With dead ends: 977534 [2018-10-24 13:19:35,731 INFO L226 Difference]: Without dead ends: 619124 [2018-10-24 13:19:35,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:19:36,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619124 states. [2018-10-24 13:19:43,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619124 to 586341. [2018-10-24 13:19:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586341 states. [2018-10-24 13:19:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586341 states to 586341 states and 612926 transitions. [2018-10-24 13:19:44,367 INFO L78 Accepts]: Start accepts. Automaton has 586341 states and 612926 transitions. Word has length 447 [2018-10-24 13:19:44,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:19:44,367 INFO L481 AbstractCegarLoop]: Abstraction has 586341 states and 612926 transitions. [2018-10-24 13:19:44,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:19:44,368 INFO L276 IsEmpty]: Start isEmpty. Operand 586341 states and 612926 transitions. [2018-10-24 13:19:44,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-10-24 13:19:44,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:19:44,414 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:19:44,414 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:19:44,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:19:44,415 INFO L82 PathProgramCache]: Analyzing trace with hash -888014199, now seen corresponding path program 1 times [2018-10-24 13:19:44,415 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:19:44,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:19:44,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:44,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:19:44,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:19:45,190 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 13:19:45,410 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 327 proven. 13 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-10-24 13:19:45,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:19:45,410 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-24 13:19:45,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 13:19:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:19:46,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:19:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2018-10-24 13:19:47,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 13:19:47,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-10-24 13:19:47,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 13:19:47,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 13:19:47,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 13:19:47,011 INFO L87 Difference]: Start difference. First operand 586341 states and 612926 transitions. Second operand 6 states. [2018-10-24 13:19:59,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:19:59,876 INFO L93 Difference]: Finished difference Result 1182711 states and 1236861 transitions. [2018-10-24 13:19:59,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 13:19:59,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 449 [2018-10-24 13:19:59,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:20:00,584 INFO L225 Difference]: With dead ends: 1182711 [2018-10-24 13:20:00,584 INFO L226 Difference]: Without dead ends: 595962 [2018-10-24 13:20:00,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-24 13:20:02,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595962 states. [2018-10-24 13:20:08,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595962 to 558411. [2018-10-24 13:20:08,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558411 states. [2018-10-24 13:20:09,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558411 states to 558411 states and 584176 transitions. [2018-10-24 13:20:09,500 INFO L78 Accepts]: Start accepts. Automaton has 558411 states and 584176 transitions. Word has length 449 [2018-10-24 13:20:09,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:20:09,500 INFO L481 AbstractCegarLoop]: Abstraction has 558411 states and 584176 transitions. [2018-10-24 13:20:09,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 13:20:09,500 INFO L276 IsEmpty]: Start isEmpty. Operand 558411 states and 584176 transitions. [2018-10-24 13:20:09,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-10-24 13:20:09,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:20:09,530 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:20:09,530 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:20:09,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:20:09,531 INFO L82 PathProgramCache]: Analyzing trace with hash 321155754, now seen corresponding path program 1 times [2018-10-24 13:20:09,531 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:20:09,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:20:09,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:20:09,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:20:09,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:20:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:20:09,956 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 452 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-10-24 13:20:09,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:20:09,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 13:20:09,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:20:09,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:20:09,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:20:09,957 INFO L87 Difference]: Start difference. First operand 558411 states and 584176 transitions. Second operand 4 states. [2018-10-24 13:20:16,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:20:16,669 INFO L93 Difference]: Finished difference Result 1012385 states and 1060234 transitions. [2018-10-24 13:20:16,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:20:16,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 469 [2018-10-24 13:20:16,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:20:17,118 INFO L225 Difference]: With dead ends: 1012385 [2018-10-24 13:20:17,118 INFO L226 Difference]: Without dead ends: 448031 [2018-10-24 13:20:17,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:20:17,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448031 states. [2018-10-24 13:20:23,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448031 to 438394. [2018-10-24 13:20:23,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438394 states. [2018-10-24 13:20:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438394 states to 438394 states and 457825 transitions. [2018-10-24 13:20:24,307 INFO L78 Accepts]: Start accepts. Automaton has 438394 states and 457825 transitions. Word has length 469 [2018-10-24 13:20:24,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:20:24,307 INFO L481 AbstractCegarLoop]: Abstraction has 438394 states and 457825 transitions. [2018-10-24 13:20:24,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:20:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 438394 states and 457825 transitions. [2018-10-24 13:20:24,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2018-10-24 13:20:24,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:20:24,329 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:20:24,330 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:20:24,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:20:24,330 INFO L82 PathProgramCache]: Analyzing trace with hash -52642602, now seen corresponding path program 1 times [2018-10-24 13:20:24,330 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:20:24,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:20:24,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:20:24,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:20:24,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:20:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:20:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 560 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-24 13:20:25,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:20:25,139 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 13:20:25,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:20:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:20:25,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-10-24 13:20:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-24 13:20:32,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 13:20:32,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2018-10-24 13:20:32,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 13:20:32,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 13:20:32,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-24 13:20:32,682 INFO L87 Difference]: Start difference. First operand 438394 states and 457825 transitions. Second operand 7 states. [2018-10-24 13:20:32,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 13:20:32,683 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 13:20:32,688 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 13:20:32,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 01:20:32 BoogieIcfgContainer [2018-10-24 13:20:32,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 13:20:32,689 INFO L168 Benchmark]: Toolchain (without parser) took 199447.70 ms. Allocated memory was 1.5 GB in the beginning and 6.5 GB in the end (delta: 5.0 GB). Free memory was 1.4 GB in the beginning and 4.8 GB in the end (delta: -3.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-24 13:20:32,690 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 13:20:32,691 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1425.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-24 13:20:32,691 INFO L168 Benchmark]: Boogie Procedure Inliner took 315.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -870.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-24 13:20:32,692 INFO L168 Benchmark]: Boogie Preprocessor took 133.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-10-24 13:20:32,693 INFO L168 Benchmark]: RCFGBuilder took 5479.82 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 253.8 MB). Peak memory consumption was 253.8 MB. Max. memory is 7.1 GB. [2018-10-24 13:20:32,694 INFO L168 Benchmark]: TraceAbstraction took 192088.35 ms. Allocated memory was 2.3 GB in the beginning and 6.5 GB in the end (delta: 4.2 GB). Free memory was 1.9 GB in the beginning and 4.8 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-10-24 13:20:32,698 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1425.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 315.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -870.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5479.82 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 253.8 MB). Peak memory consumption was 253.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192088.35 ms. Allocated memory was 2.3 GB in the beginning and 6.5 GB in the end (delta: 4.2 GB). Free memory was 1.9 GB in the beginning and 4.8 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1470]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (438394states) and FLOYD_HOARE automaton (currently 2 states, 7 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 192.0s OverallTime, 25 OverallIterations, 6 TraceHistogramMax, 104.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5520 SDtfs, 17445 SDslu, 3567 SDs, 0 SdLazy, 29323 SolverSat, 4895 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 62.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1765 GetRequests, 1682 SyntacticMatches, 11 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=586341occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 65.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 218661 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 8931 NumberOfCodeBlocks, 8931 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 8902 ConstructedInterpolants, 0 QuantifiedInterpolants, 9839738 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2753 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 29 InterpolantComputations, 25 PerfectInterpolantSequences, 7747/7828 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown